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

% Computer : n021.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:03 EDT 2022

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

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

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

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

cnf(10,plain,
    ~ axiom(or__dfg(not__dfg(q),or__dfg(not__dfg(p),q))),
    inference(res,[status(thm),theory(equality)],[7,1]),
    [iquote('0:Res:7.1,1.0')] ).

cnf(13,plain,
    $false,
    inference(mrr,[status(thm)],[10,3]),
    [iquote('0:MRR:10.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : LCL170-1 : TPTP v8.1.0. Released v1.1.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n021.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jul  3 13:22:16 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.42  
% 0.21/0.42  SPASS V 3.9 
% 0.21/0.42  SPASS beiseite: Proof found.
% 0.21/0.42  % SZS status Theorem
% 0.21/0.42  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.21/0.42  SPASS derived 2 clauses, backtracked 0 clauses, performed 0 splits and kept 10 clauses.
% 0.21/0.42  SPASS allocated 75607 KBytes.
% 0.21/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.21/0.42  		0:00:00.04 for the input.
% 0.21/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42  		0:00:00.00 for inferences.
% 0.21/0.42  		0:00:00.00 for the backtracking.
% 0.21/0.42  		0:00:00.00 for the reduction.
% 0.21/0.42  
% 0.21/0.42  
% 0.21/0.42  Here is a proof with depth 1, length 5 :
% 0.21/0.42  % SZS output start Refutation
% See solution above
% 0.21/0.42  Formulae used in the proof : prove_this axiom_1_3 rule_1
% 0.21/0.42  
%------------------------------------------------------------------------------