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

% Computer : n001.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 09:20:50 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    truth: $i ).

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

tff(decl_24,type,
    falsity: $i ).

tff(decl_25,type,
    xor: ( $i * $i ) > $i ).

cnf(evaluate_expression,negated_conjecture,
    ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',evaluate_expression) ).

cnf(false_xor_false,axiom,
    ( value(xor(X1,X2),falsity)
    | ~ value(X1,falsity)
    | ~ value(X2,falsity) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_xor_false) ).

cnf(false_is_false,axiom,
    value(falsity,falsity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',false_is_false) ).

cnf(true_xor_true,axiom,
    ( value(xor(X1,X2),falsity)
    | ~ value(X1,truth)
    | ~ value(X2,truth) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',true_xor_true) ).

cnf(true_is_true,axiom,
    value(truth,truth),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',true_is_true) ).

cnf(true_xor_false,axiom,
    ( value(xor(X1,X2),truth)
    | ~ value(X1,truth)
    | ~ value(X2,falsity) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',true_xor_false) ).

cnf(c_0_6,negated_conjecture,
    ~ value(xor(xor(xor(xor(truth,falsity),falsity),truth),falsity),X1),
    evaluate_expression ).

cnf(c_0_7,axiom,
    ( value(xor(X1,X2),falsity)
    | ~ value(X1,falsity)
    | ~ value(X2,falsity) ),
    false_xor_false ).

cnf(c_0_8,axiom,
    value(falsity,falsity),
    false_is_false ).

cnf(c_0_9,negated_conjecture,
    ~ value(xor(xor(xor(truth,falsity),falsity),truth),falsity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_10,axiom,
    ( value(xor(X1,X2),falsity)
    | ~ value(X1,truth)
    | ~ value(X2,truth) ),
    true_xor_true ).

cnf(c_0_11,axiom,
    value(truth,truth),
    true_is_true ).

cnf(c_0_12,negated_conjecture,
    ~ value(xor(xor(truth,falsity),falsity),truth),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).

cnf(c_0_13,axiom,
    ( value(xor(X1,X2),truth)
    | ~ value(X1,truth)
    | ~ value(X2,falsity) ),
    true_xor_false ).

cnf(c_0_14,negated_conjecture,
    ~ value(xor(truth,falsity),truth),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_8])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MSC005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n001.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Thu Aug 24 14:23:56 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.60  start to proof: theBenchmark
% 0.19/0.61  % Version  : CSE_E---1.5
% 0.19/0.61  % Problem  : theBenchmark.p
% 0.19/0.61  % Proof found
% 0.19/0.61  % SZS status Theorem for theBenchmark.p
% 0.19/0.61  % SZS output start Proof
% See solution above
% 0.19/0.61  % Total time : 0.003000 s
% 0.19/0.61  % SZS output end Proof
% 0.19/0.61  % Total time : 0.006000 s
%------------------------------------------------------------------------------