%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL172-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n031.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  : 300s
% DateTime : Thu Aug 31 06:52:36 EDT 2023

% Result   : Unsatisfiable 0.18s 0.56s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   14 (   5 unt;   7 typ;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   4   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    or: ( $i * $i ) > $i ).

tff(decl_23,type,
    not: $i > $i ).

tff(decl_24,type,
    axiom: $i > $o ).

tff(decl_25,type,
    theorem: $i > $o ).

tff(decl_26,type,
    p: $i ).

tff(decl_27,type,
    q: $i ).

tff(decl_28,type,
    r: $i ).

cnf(prove_this,negated_conjecture,
    ~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

cnf(rule_1,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).

cnf(axiom_1_5,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

cnf(c_0_3,negated_conjecture,
    ~ theorem(or(not(or(not(p),or(not(q),r))),or(not(q),or(not(p),r)))),
    prove_this ).

cnf(c_0_4,axiom,
    ( theorem(X1)
    | ~ axiom(X1) ),
    rule_1 ).

cnf(c_0_5,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    axiom_1_5 ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL172-1 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n031.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    : 300
% 0.12/0.33  % DateTime   : Fri Aug 25 02:02:36 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.18/0.55  start to proof: theBenchmark
% 0.18/0.56  % Version  : CSE_E---1.5
% 0.18/0.56  % Problem  : theBenchmark.p
% 0.18/0.56  % Proof found
% 0.18/0.56  % SZS status Theorem for theBenchmark.p
% 0.18/0.56  % SZS output start Proof
% See solution above
% 0.18/0.56  % Total time : 0.004000 s
% 0.18/0.56  % SZS output end Proof
% 0.18/0.56  % Total time : 0.006000 s
%------------------------------------------------------------------------------