%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n032.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:43 EDT 2023

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

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

tff(decl_23,type,
    or: ( $i * $i ) > $i ).

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

tff(decl_25,type,
    axiom: $i > $i ).

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

tff(decl_27,type,
    theorem: $i > $i ).

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

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

cnf(rule_3,axiom,
    ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).

cnf(axiom_1_3,axiom,
    axiom(or(not(X1),or(X2,X1))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

cnf(ifeq_axiom,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(rule_1,axiom,
    ifeq(axiom(X1),true,theorem(X1),true) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

cnf(axiom_1_4,axiom,
    axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

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

cnf(c_0_6,axiom,
    ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
    rule_3 ).

cnf(c_0_7,axiom,
    axiom(or(not(X1),or(X2,X1))) = true,
    axiom_1_3 ).

cnf(c_0_8,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_9,axiom,
    ifeq(axiom(X1),true,theorem(X1),true) = true,
    rule_1 ).

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

cnf(c_0_11,plain,
    ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(X2),X3)),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_12,plain,
    theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    theorem(or(not(not(p)),or(not(p),q))) != true,
    prove_this ).

cnf(c_0_14,plain,
    theorem(or(not(X1),or(X1,X2))) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : LCL186-10 : TPTP v8.1.2. Released v7.5.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Fri Aug 25 04:26:27 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 0.17/0.49  start to proof: theBenchmark
% 0.17/0.51  % Version  : CSE_E---1.5
% 0.17/0.51  % Problem  : theBenchmark.p
% 0.17/0.51  % Proof found
% 0.17/0.51  % SZS status Theorem for theBenchmark.p
% 0.17/0.51  % SZS output start Proof
% See solution above
% 0.17/0.51  % Total time : 0.007000 s
% 0.17/0.51  % SZS output end Proof
% 0.17/0.51  % Total time : 0.009000 s
%------------------------------------------------------------------------------