TSTP Solution File: LCL119-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL119-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 14:34:46 EDT 2022

% Result   : Unsatisfiable 56.87s 57.32s
% Output   : Refutation 56.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   46 (  25 unt;   0 nHn;  46 RR)
%            Number of literals    :   75 (   0 equ;  30 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(equivalent(u,v))
    | is_a_theorem(v) ),
    file('LCL119-1.p',unknown),
    [] ).

cnf(2,axiom,
    is_a_theorem(equivalent(u,equivalent(equivalent(v,equivalent(w,u)),equivalent(v,w)))),
    file('LCL119-1.p',unknown),
    [] ).

cnf(3,axiom,
    ~ is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(b,a)))),
    file('LCL119-1.p',unknown),
    [] ).

cnf(7,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(equivalent(v,equivalent(w,u)),equivalent(v,w))) ),
    inference(res,[status(thm),theory(equality)],[2,1]),
    [iquote('0:Res:2.0,1.1')] ).

cnf(8,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(equivalent(v,equivalent(w,u)))
    | is_a_theorem(equivalent(v,w)) ),
    inference(res,[status(thm),theory(equality)],[7,1]),
    [iquote('0:Res:7.1,1.1')] ).

cnf(9,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(v)
    | is_a_theorem(equivalent(equivalent(w,equivalent(u,v)),w)) ),
    inference(sor,[status(thm)],[8,7]),
    [iquote('0:SoR:8.1,7.1')] ).

cnf(10,plain,
    ( ~ is_a_theorem(equivalent(u,v))
    | is_a_theorem(equivalent(w,equivalent(u,equivalent(v,w)))) ),
    inference(sor,[status(thm)],[8,2]),
    [iquote('0:SoR:8.1,2.0')] ).

cnf(11,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(v,equivalent(equivalent(w,equivalent(x,u)),equivalent(equivalent(w,x),v)))) ),
    inference(sor,[status(thm)],[10,7]),
    [iquote('0:SoR:10.0,7.1')] ).

cnf(12,plain,
    is_a_theorem(equivalent(u,equivalent(v,equivalent(equivalent(equivalent(w,equivalent(x,v)),equivalent(w,x)),u)))),
    inference(sor,[status(thm)],[10,2]),
    [iquote('0:SoR:10.0,2.0')] ).

cnf(15,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(v)
    | ~ is_a_theorem(equivalent(w,equivalent(u,v)))
    | is_a_theorem(w) ),
    inference(res,[status(thm),theory(equality)],[9,1]),
    [iquote('0:Res:9.2,1.1')] ).

cnf(18,plain,
    ( ~ is_a_theorem(equivalent(u,equivalent(v,w)))
    | ~ is_a_theorem(equivalent(u,v))
    | is_a_theorem(w) ),
    inference(sor,[status(thm)],[15,2]),
    [iquote('0:SoR:15.2,2.0')] ).

cnf(21,plain,
    ( ~ is_a_theorem(equivalent(u,equivalent(v,equivalent(w,u))))
    | is_a_theorem(equivalent(v,w)) ),
    inference(sor,[status(thm)],[18,2]),
    [iquote('0:SoR:18.0,2.0')] ).

cnf(24,plain,
    ( ~ is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(v,w)),equivalent(u,v)),x))
    | is_a_theorem(equivalent(x,w)) ),
    inference(sor,[status(thm)],[8,12]),
    [iquote('0:SoR:8.1,12.0')] ).

cnf(29,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(v,v)),u)),
    inference(sor,[status(thm)],[21,2]),
    [iquote('0:SoR:21.0,2.0')] ).

cnf(35,plain,
    ( ~ is_a_theorem(equivalent(u,equivalent(v,v)))
    | is_a_theorem(u) ),
    inference(res,[status(thm),theory(equality)],[29,1]),
    [iquote('0:Res:29.0,1.1')] ).

cnf(36,plain,
    is_a_theorem(equivalent(equivalent(u,u),equivalent(v,v))),
    inference(sor,[status(thm)],[35,29]),
    [iquote('0:SoR:35.0,29.0')] ).

cnf(43,plain,
    ( ~ is_a_theorem(equivalent(equivalent(u,u),v))
    | is_a_theorem(v) ),
    inference(sor,[status(thm)],[18,36]),
    [iquote('0:SoR:18.0,36.0')] ).

cnf(45,plain,
    is_a_theorem(equivalent(u,u)),
    inference(sor,[status(thm)],[35,36]),
    [iquote('0:SoR:35.0,36.0')] ).

cnf(52,plain,
    ( ~ is_a_theorem(equivalent(u,equivalent(v,equivalent(w,x))))
    | ~ is_a_theorem(x)
    | is_a_theorem(equivalent(equivalent(v,w),u)) ),
    inference(sor,[status(thm)],[18,11]),
    [iquote('0:SoR:18.0,11.1')] ).

cnf(56,plain,
    is_a_theorem(equivalent(u,equivalent(v,equivalent(v,u)))),
    inference(sor,[status(thm)],[10,45]),
    [iquote('0:SoR:10.0,45.0')] ).

cnf(57,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(equivalent(v,u),v)) ),
    inference(sor,[status(thm)],[8,45]),
    [iquote('0:SoR:8.1,45.0')] ).

cnf(64,plain,
    ( ~ is_a_theorem(equivalent(u,v))
    | is_a_theorem(equivalent(v,u)) ),
    inference(sor,[status(thm)],[8,56]),
    [iquote('0:SoR:8.1,56.0')] ).

cnf(105,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(v,equivalent(w,w))),equivalent(u,v))),
    inference(sor,[status(thm)],[43,2]),
    [iquote('0:SoR:43.0,2.0')] ).

cnf(130,plain,
    ( ~ is_a_theorem(u)
    | ~ is_a_theorem(equivalent(v,u))
    | is_a_theorem(v) ),
    inference(res,[status(thm),theory(equality)],[57,1]),
    [iquote('0:Res:57.1,1.1')] ).

cnf(152,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(u,v)),v)),
    inference(sor,[status(thm)],[64,56]),
    [iquote('0:SoR:64.0,56.0')] ).

cnf(161,plain,
    is_a_theorem(equivalent(u,equivalent(equivalent(v,equivalent(v,w)),equivalent(w,u)))),
    inference(sor,[status(thm)],[10,152]),
    [iquote('0:SoR:10.0,152.0')] ).

cnf(319,plain,
    is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(equivalent(v,v),w)),u),w)),
    inference(sor,[status(thm)],[24,105]),
    [iquote('0:SoR:24.0,105.0')] ).

cnf(372,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(u,v)),equivalent(v,equivalent(w,w)))),
    inference(sor,[status(thm)],[43,161]),
    [iquote('0:SoR:43.0,161.0')] ).

cnf(530,plain,
    is_a_theorem(equivalent(u,equivalent(equivalent(v,equivalent(equivalent(w,w),u)),v))),
    inference(sor,[status(thm)],[64,319]),
    [iquote('0:SoR:64.0,319.0')] ).

cnf(602,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(v,v)),equivalent(w,equivalent(w,u)))),
    inference(sor,[status(thm)],[64,372]),
    [iquote('0:SoR:64.0,372.0')] ).

cnf(722,plain,
    is_a_theorem(equivalent(equivalent(equivalent(u,v),equivalent(equivalent(w,w),v)),u)),
    inference(sor,[status(thm)],[21,530]),
    [iquote('0:SoR:21.0,530.0')] ).

cnf(820,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(u,equivalent(v,equivalent(v,w)))),w)),
    inference(sor,[status(thm)],[24,602]),
    [iquote('0:SoR:24.0,602.0')] ).

cnf(874,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(equivalent(u,v),equivalent(equivalent(w,w),v))) ),
    inference(sor,[status(thm)],[130,722]),
    [iquote('0:SoR:130.1,722.0')] ).

cnf(921,plain,
    is_a_theorem(equivalent(u,equivalent(v,equivalent(v,equivalent(w,equivalent(w,u)))))),
    inference(sor,[status(thm)],[64,820]),
    [iquote('0:SoR:64.0,820.0')] ).

cnf(6742,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(equivalent(equivalent(v,v),w),equivalent(u,w))) ),
    inference(sor,[status(thm)],[64,874]),
    [iquote('0:SoR:64.0,874.1')] ).

cnf(12502,plain,
    ( ~ is_a_theorem(u)
    | is_a_theorem(equivalent(equivalent(u,equivalent(equivalent(v,w),v)),w)) ),
    inference(sor,[status(thm)],[24,6742]),
    [iquote('0:SoR:24.0,6742.1')] ).

cnf(13974,plain,
    ( ~ is_a_theorem(equivalent(equivalent(u,v),equivalent(u,w)))
    | is_a_theorem(equivalent(v,w)) ),
    inference(sor,[status(thm)],[24,12502]),
    [iquote('0:SoR:24.0,12502.1')] ).

cnf(14507,plain,
    is_a_theorem(equivalent(u,equivalent(v,equivalent(w,equivalent(w,equivalent(v,u)))))),
    inference(sor,[status(thm)],[13974,921]),
    [iquote('0:SoR:13974.0,921.0')] ).

cnf(14658,plain,
    ( ~ is_a_theorem(equivalent(u,equivalent(v,w)))
    | is_a_theorem(equivalent(equivalent(v,u),w)) ),
    inference(sor,[status(thm)],[52,14507]),
    [iquote('0:SoR:52.0,14507.0')] ).

cnf(15131,plain,
    is_a_theorem(equivalent(equivalent(equivalent(u,equivalent(v,w)),w),equivalent(u,v))),
    inference(sor,[status(thm)],[14658,2]),
    [iquote('0:SoR:14658.0,2.0')] ).

cnf(16455,plain,
    is_a_theorem(equivalent(equivalent(u,v),equivalent(equivalent(u,equivalent(v,w)),w))),
    inference(sor,[status(thm)],[64,15131]),
    [iquote('0:SoR:64.0,15131.0')] ).

cnf(16999,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(v,equivalent(w,equivalent(u,v)))),w)),
    inference(sor,[status(thm)],[21,16455]),
    [iquote('0:SoR:21.0,16455.0')] ).

cnf(17539,plain,
    is_a_theorem(equivalent(u,equivalent(v,equivalent(w,equivalent(u,equivalent(v,w)))))),
    inference(sor,[status(thm)],[64,16999]),
    [iquote('0:SoR:64.0,16999.0')] ).

cnf(18135,plain,
    is_a_theorem(equivalent(equivalent(u,v),equivalent(w,equivalent(v,equivalent(u,w))))),
    inference(sor,[status(thm)],[14658,17539]),
    [iquote('0:SoR:14658.0,17539.0')] ).

cnf(18958,plain,
    is_a_theorem(equivalent(equivalent(u,equivalent(v,w)),equivalent(w,equivalent(v,u)))),
    inference(sor,[status(thm)],[14658,18135]),
    [iquote('0:SoR:14658.0,18135.0')] ).

cnf(19031,plain,
    $false,
    inference(unc,[status(thm)],[18958,3]),
    [iquote('0:UnC:18958.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem  : LCL119-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul  4 15:38:29 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 56.87/57.32  
% 56.87/57.32  SPASS V 3.9 
% 56.87/57.32  SPASS beiseite: Proof found.
% 56.87/57.32  % SZS status Theorem
% 56.87/57.32  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 56.87/57.32  SPASS derived 18173 clauses, backtracked 0 clauses, performed 0 splits and kept 7089 clauses.
% 56.87/57.32  SPASS allocated 94696 KBytes.
% 56.87/57.32  SPASS spent	0:0:56.25 on the problem.
% 56.87/57.32  		0:00:00.03 for the input.
% 56.87/57.32  		0:00:00.00 for the FLOTTER CNF translation.
% 56.87/57.32  		0:00:00.34 for inferences.
% 56.87/57.32  		0:00:00.00 for the backtracking.
% 56.87/57.32  		0:0:55.81 for the reduction.
% 56.87/57.32  
% 56.87/57.32  
% 56.87/57.32  Here is a proof with depth 26, length 46 :
% 56.87/57.32  % SZS output start Refutation
% See solution above
% 56.87/57.32  Formulae used in the proof : condensed_detachment xgj prove_wo
% 56.87/57.32  
%------------------------------------------------------------------------------