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

% Computer : n010.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:45 EDT 2023

% Result   : Unsatisfiable 0.21s 0.63s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   24 (  10 unt;   7 typ;   0 def)
%            Number of atoms       :   26 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    5 (   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   :   30 (   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(rule_2,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).

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

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

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

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

cnf(c_0_5,axiom,
    ( theorem(X1)
    | ~ axiom(or(not(X2),X1))
    | ~ theorem(X2) ),
    rule_2 ).

cnf(c_0_6,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))),
    axiom_1_4 ).

cnf(c_0_7,plain,
    ( theorem(or(X1,X2))
    | ~ theorem(or(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

cnf(c_0_9,plain,
    ( theorem(or(X1,X2))
    | ~ axiom(or(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
    axiom_1_6 ).

cnf(c_0_11,plain,
    theorem(or(or(X1,X2),not(or(X2,X1)))),
    inference(spm,[status(thm)],[c_0_9,c_0_6]) ).

cnf(c_0_12,plain,
    ( theorem(or(not(or(X1,X2)),or(X1,X3)))
    | ~ theorem(or(not(X2),X3)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_10]) ).

cnf(c_0_13,plain,
    theorem(or(not(or(X1,X2)),or(X2,X1))),
    inference(spm,[status(thm)],[c_0_7,c_0_11]) ).

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

cnf(c_0_15,plain,
    theorem(or(not(or(X1,or(X2,X3))),or(X1,or(X3,X2)))),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL190-1 : TPTP v8.1.2. Released v1.1.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n010.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Aug 25 04:04:50 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.21/0.58  start to proof: theBenchmark
% 0.21/0.63  % Version  : CSE_E---1.5
% 0.21/0.63  % Problem  : theBenchmark.p
% 0.21/0.63  % Proof found
% 0.21/0.63  % SZS status Theorem for theBenchmark.p
% 0.21/0.63  % SZS output start Proof
% See solution above
% 0.21/0.64  % Total time : 0.044000 s
% 0.21/0.64  % SZS output end Proof
% 0.21/0.64  % Total time : 0.046000 s
%------------------------------------------------------------------------------