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

View Problem - Process Solution

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

% Computer : n013.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:35:32 EDT 2022

% Result   : Unsatisfiable 13.37s 13.62s
% Output   : Refutation 13.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   24 (  13 unt;   0 nHn;  24 RR)
%            Number of literals    :   38 (   0 equ;  15 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ~ theorem(or__dfg(not__dfg(or__dfg(p,q)),or__dfg(not__dfg(or__dfg(p,not__dfg(q))),p))),
    file('LCL216-1.p',unknown),
    [] ).

cnf(2,axiom,
    axiom(or__dfg(not__dfg(or__dfg(u,u)),u)),
    file('LCL216-1.p',unknown),
    [] ).

cnf(4,axiom,
    axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
    file('LCL216-1.p',unknown),
    [] ).

cnf(5,axiom,
    axiom(or__dfg(not__dfg(or__dfg(u,or__dfg(v,w))),or__dfg(v,or__dfg(u,w)))),
    file('LCL216-1.p',unknown),
    [] ).

cnf(6,axiom,
    axiom(or__dfg(not__dfg(or__dfg(not__dfg(u),v)),or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v)))),
    file('LCL216-1.p',unknown),
    [] ).

cnf(7,axiom,
    ( ~ axiom(u)
    | theorem(u) ),
    file('LCL216-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( ~ theorem(u)
    | ~ axiom(or__dfg(not__dfg(u),v))
    | theorem(v) ),
    file('LCL216-1.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ theorem(or__dfg(not__dfg(u),v))
    | ~ axiom(or__dfg(not__dfg(w),u))
    | theorem(or__dfg(not__dfg(w),v)) ),
    file('LCL216-1.p',unknown),
    [] ).

cnf(23,plain,
    ( ~ theorem(or__dfg(u,v))
    | theorem(or__dfg(v,u)) ),
    inference(res,[status(thm),theory(equality)],[4,8]),
    [iquote('0:Res:4.0,8.1')] ).

cnf(27,plain,
    ( ~ axiom(or__dfg(u,v))
    | theorem(or__dfg(v,u)) ),
    inference(sor,[status(thm)],[23,7]),
    [iquote('0:SoR:23.0,7.1')] ).

cnf(30,plain,
    ( ~ theorem(or__dfg(u,or__dfg(v,w)))
    | theorem(or__dfg(v,or__dfg(u,w))) ),
    inference(res,[status(thm),theory(equality)],[5,8]),
    [iquote('0:Res:5.0,8.1')] ).

cnf(34,plain,
    theorem(or__dfg(u,not__dfg(or__dfg(u,u)))),
    inference(sor,[status(thm)],[27,2]),
    [iquote('0:SoR:27.0,2.0')] ).

cnf(36,plain,
    theorem(or__dfg(not__dfg(or__dfg(u,u)),u)),
    inference(sor,[status(thm)],[23,34]),
    [iquote('0:SoR:23.0,34.0')] ).

cnf(48,plain,
    ( ~ theorem(or__dfg(not__dfg(u),v))
    | theorem(or__dfg(not__dfg(or__dfg(w,u)),or__dfg(w,v))) ),
    inference(res,[status(thm),theory(equality)],[6,8]),
    [iquote('0:Res:6.0,8.1')] ).

cnf(59,plain,
    ( ~ axiom(or__dfg(not__dfg(u),v))
    | ~ theorem(or__dfg(not__dfg(v),w))
    | theorem(or__dfg(w,not__dfg(u))) ),
    inference(sor,[status(thm)],[23,9]),
    [iquote('0:SoR:23.0,9.2')] ).

cnf(108,plain,
    theorem(or__dfg(not__dfg(or__dfg(u,or__dfg(v,v))),or__dfg(u,v))),
    inference(sor,[status(thm)],[48,36]),
    [iquote('0:SoR:48.0,36.0')] ).

cnf(282,plain,
    ( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
    | theorem(or__dfg(w,not__dfg(or__dfg(v,u)))) ),
    inference(res,[status(thm),theory(equality)],[4,59]),
    [iquote('0:Res:4.0,59.0')] ).

cnf(284,plain,
    ( ~ theorem(or__dfg(not__dfg(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(u,w))),x))
    | theorem(or__dfg(x,not__dfg(or__dfg(not__dfg(v),w)))) ),
    inference(res,[status(thm),theory(equality)],[6,59]),
    [iquote('0:Res:6.0,59.0')] ).

cnf(784,plain,
    ( ~ theorem(or__dfg(not__dfg(or__dfg(u,v)),w))
    | theorem(or__dfg(not__dfg(or__dfg(v,u)),w)) ),
    inference(sor,[status(thm)],[23,282]),
    [iquote('0:SoR:23.0,282.1')] ).

cnf(1559,plain,
    theorem(or__dfg(or__dfg(not__dfg(or__dfg(u,v)),u),not__dfg(or__dfg(not__dfg(v),u)))),
    inference(res,[status(thm),theory(equality)],[108,284]),
    [iquote('0:Res:108.0,284.0')] ).

cnf(9963,plain,
    theorem(or__dfg(not__dfg(or__dfg(not__dfg(u),v)),or__dfg(not__dfg(or__dfg(v,u)),v))),
    inference(sor,[status(thm)],[23,1559]),
    [iquote('0:SoR:23.0,1559.0')] ).

cnf(14109,plain,
    theorem(or__dfg(not__dfg(or__dfg(u,not__dfg(v))),or__dfg(not__dfg(or__dfg(u,v)),u))),
    inference(res,[status(thm),theory(equality)],[9963,784]),
    [iquote('0:Res:9963.0,784.0')] ).

cnf(16398,plain,
    theorem(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(not__dfg(or__dfg(u,not__dfg(v))),u))),
    inference(sor,[status(thm)],[30,14109]),
    [iquote('0:SoR:30.0,14109.0')] ).

cnf(16424,plain,
    $false,
    inference(unc,[status(thm)],[16398,1]),
    [iquote('0:UnC:16398.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL216-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon Jul  4 23:52:14 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 13.37/13.62  
% 13.37/13.62  SPASS V 3.9 
% 13.37/13.62  SPASS beiseite: Proof found.
% 13.37/13.62  % SZS status Theorem
% 13.37/13.62  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 13.37/13.62  SPASS derived 16400 clauses, backtracked 0 clauses, performed 0 splits and kept 9556 clauses.
% 13.37/13.62  SPASS allocated 101139 KBytes.
% 13.37/13.62  SPASS spent	0:0:12.92 on the problem.
% 13.37/13.62  		0:00:00.04 for the input.
% 13.37/13.62  		0:00:00.00 for the FLOTTER CNF translation.
% 13.37/13.62  		0:00:00.39 for inferences.
% 13.37/13.62  		0:00:00.00 for the backtracking.
% 13.37/13.62  		0:0:12.29 for the reduction.
% 13.37/13.62  
% 13.37/13.62  
% 13.37/13.62  Here is a proof with depth 9, length 24 :
% 13.37/13.62  % SZS output start Refutation
% See solution above
% 13.37/13.62  Formulae used in the proof : prove_this axiom_1_2 axiom_1_4 axiom_1_5 axiom_1_6 rule_1 rule_2 rule_3
% 13.37/13.62  
%------------------------------------------------------------------------------