%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : LCL186-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:13 EDT 2022

% Result   : Unsatisfiable 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   13 (   7 unt;   0 nHn;  13 RR)
%            Number of literals    :   21 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   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(not__dfg(not__dfg(p)),or__dfg(not__dfg(p),q))),
    file('LCL186-1.p',unknown),
    [] ).

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

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

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

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

cnf(11,plain,
    ( ~ theorem(or__dfg(not__dfg(u),or__dfg(not__dfg(p),q)))
    | ~ axiom(or__dfg(not__dfg(not__dfg(p)),u)) ),
    inference(res,[status(thm),theory(equality)],[9,1]),
    [iquote('0:Res:9.2,1.0')] ).

cnf(24,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(33,plain,
    ( ~ axiom(or__dfg(u,v))
    | theorem(or__dfg(v,u)) ),
    inference(sor,[status(thm)],[24,7]),
    [iquote('0:SoR:24.0,7.1')] ).

cnf(43,plain,
    theorem(or__dfg(or__dfg(u,v),not__dfg(or__dfg(v,u)))),
    inference(sor,[status(thm)],[33,4]),
    [iquote('0:SoR:33.0,4.0')] ).

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

cnf(109,plain,
    ~ axiom(or__dfg(not__dfg(not__dfg(p)),or__dfg(q,not__dfg(p)))),
    inference(res,[status(thm),theory(equality)],[59,11]),
    [iquote('0:Res:59.0,11.0')] ).

cnf(115,plain,
    $false,
    inference(mrr,[status(thm)],[109,3]),
    [iquote('0:MRR:109.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : LCL186-1 : TPTP v8.1.0. Released v1.1.0.
% 0.03/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 : Sun Jul  3 14:01:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.41  
% 0.19/0.41  SPASS V 3.9 
% 0.19/0.41  SPASS beiseite: Proof found.
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.41  SPASS derived 96 clauses, backtracked 0 clauses, performed 0 splits and kept 76 clauses.
% 0.19/0.41  SPASS allocated 75766 KBytes.
% 0.19/0.41  SPASS spent	0:00:00.07 on the problem.
% 0.19/0.41  		0:00:00.04 for the input.
% 0.19/0.41  		0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.41  		0:00:00.00 for inferences.
% 0.19/0.41  		0:00:00.00 for the backtracking.
% 0.19/0.41  		0:00:00.01 for the reduction.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Here is a proof with depth 5, length 13 :
% 0.19/0.41  % SZS output start Refutation
% See solution above
% 0.19/0.41  Formulae used in the proof : prove_this axiom_1_3 axiom_1_4 rule_1 rule_2 rule_3
% 0.19/0.41  
%------------------------------------------------------------------------------