%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n008.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:53:07 EDT 2023

% Result   : Unsatisfiable 1.28s 1.39s
% Output   : CNFRefutation 1.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   41 (  21 unt;   6 typ;   0 def)
%            Number of atoms       :   53 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  20   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   76 (  13 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 ).

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(rule_3,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

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

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(axiom_1_5,axiom,
    axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

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

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

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

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

cnf(c_0_11,plain,
    ( theorem(or(X1,X2))
    | ~ theorem(or(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_13,plain,
    ( theorem(or(X1,X2))
    | ~ axiom(or(X2,X1)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    ( theorem(or(not(X1),X2))
    | ~ axiom(or(not(X1),X3))
    | ~ theorem(or(not(X3),X2)) ),
    rule_3 ).

cnf(c_0_15,axiom,
    axiom(or(not(X1),or(X2,X1))),
    axiom_1_3 ).

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

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

cnf(c_0_18,plain,
    ( theorem(or(not(X1),X2))
    | ~ theorem(or(not(or(X3,X1)),X2)) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

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

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

cnf(c_0_21,plain,
    ( theorem(or(not(or(X1,X2)),or(X1,X3)))
    | ~ theorem(or(not(X2),X3)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_17]) ).

cnf(c_0_22,plain,
    theorem(or(not(X1),or(X1,X2))),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,plain,
    ( theorem(or(X1,or(X2,X3)))
    | ~ theorem(or(X2,or(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_9,c_0_20]) ).

cnf(c_0_24,plain,
    ( theorem(or(X1,X2))
    | ~ theorem(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_15]) ).

cnf(c_0_25,plain,
    theorem(or(not(or(X1,X2)),or(X1,or(X2,X3)))),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_26,plain,
    ( theorem(or(X1,or(X2,X3)))
    | ~ theorem(or(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    theorem(or(or(X1,or(X2,X3)),not(or(X1,X2)))),
    inference(spm,[status(thm)],[c_0_11,c_0_25]) ).

cnf(c_0_28,axiom,
    axiom(or(not(or(X1,X1)),X1)),
    axiom_1_2 ).

cnf(c_0_29,plain,
    theorem(or(or(X1,or(X2,X3)),or(X4,not(or(X1,X2))))),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,plain,
    ( theorem(X1)
    | ~ theorem(or(X1,X1)) ),
    inference(spm,[status(thm)],[c_0_9,c_0_28]) ).

cnf(c_0_31,plain,
    theorem(or(or(X1,or(X2,X3)),or(X4,or(X5,not(or(X1,X2)))))),
    inference(spm,[status(thm)],[c_0_26,c_0_29]) ).

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

cnf(c_0_33,plain,
    theorem(or(X1,or(X2,not(or(X1,X2))))),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : LCL234-1 : TPTP v8.1.2. Bugfixed v2.3.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.35  % Computer : n008.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Fri Aug 25 04:33:32 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.19/0.58  start to proof: theBenchmark
% 1.28/1.39  % Version  : CSE_E---1.5
% 1.28/1.39  % Problem  : theBenchmark.p
% 1.28/1.39  % Proof found
% 1.28/1.39  % SZS status Theorem for theBenchmark.p
% 1.28/1.39  % SZS output start Proof
% See solution above
% 1.28/1.39  % Total time : 0.797000 s
% 1.28/1.39  % SZS output end Proof
% 1.28/1.39  % Total time : 0.800000 s
%------------------------------------------------------------------------------