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

View Problem - Process Solution

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

% Computer : n025.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:14 EDT 2022

% Result   : Unsatisfiable 0.18s 0.41s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (  11 unt;   0 nHn;  17 RR)
%            Number of literals    :   24 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

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

cnf(4,axiom,
    axiom(or__dfg(not__dfg(or__dfg(u,v)),or__dfg(v,u))),
    file('LCL188-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('LCL188-1.p',unknown),
    [] ).

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

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

cnf(21,plain,
    ( ~ theorem(or__dfg(u,u))
    | theorem(u) ),
    inference(res,[status(thm),theory(equality)],[2,8]),
    [iquote('0:Res:2.0,8.1')] ).

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,
    ( ~ 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(32,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(43,plain,
    theorem(or__dfg(or__dfg(u,v),not__dfg(v))),
    inference(sor,[status(thm)],[32,3]),
    [iquote('0:SoR:32.0,3.0')] ).

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

cnf(61,plain,
    theorem(or__dfg(u,or__dfg(not__dfg(v),v))),
    inference(sor,[status(thm)],[27,45]),
    [iquote('0:SoR:27.0,45.0')] ).

cnf(66,plain,
    theorem(or__dfg(not__dfg(u),u)),
    inference(sor,[status(thm)],[21,61]),
    [iquote('0:SoR:21.0,61.0')] ).

cnf(69,plain,
    theorem(or__dfg(u,or__dfg(not__dfg(or__dfg(u,v)),v))),
    inference(sor,[status(thm)],[27,66]),
    [iquote('0:SoR:27.0,66.0')] ).

cnf(72,plain,
    $false,
    inference(unc,[status(thm)],[69,1]),
    [iquote('0:UnC:69.0,1.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : LCL188-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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 18:12:11 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.41  
% 0.18/0.41  SPASS V 3.9 
% 0.18/0.41  SPASS beiseite: Proof found.
% 0.18/0.41  % SZS status Theorem
% 0.18/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.41  SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 48 clauses.
% 0.18/0.41  SPASS allocated 75698 KBytes.
% 0.18/0.41  SPASS spent	0:00:00.07 on the problem.
% 0.18/0.41  		0:00:00.04 for the input.
% 0.18/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.41  		0:00:00.00 for inferences.
% 0.18/0.41  		0:00:00.00 for the backtracking.
% 0.18/0.41  		0:00:00.00 for the reduction.
% 0.18/0.41  
% 0.18/0.41  
% 0.18/0.41  Here is a proof with depth 7, length 17 :
% 0.18/0.41  % SZS output start Refutation
% See solution above
% 0.18/0.41  Formulae used in the proof : prove_this axiom_1_2 axiom_1_3 axiom_1_4 axiom_1_5 rule_1 rule_2
% 0.18/0.41  
%------------------------------------------------------------------------------