%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL238-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Sep 7 11:20:37 AM UTC 2026
% Result : Unsatisfiable 0.63s 0.57s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL238-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.10/0.37 % Computer : n028.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 4 22:20:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.23/0.49 start to proof:theBenchmark.p
% 0.63/0.57 % Version : CSI_E---1.1
% 0.63/0.57 % Problem : theBenchmark.p
% 0.63/0.57 % Proof found!
% 0.63/0.57 # SZS status Unsatisfiable
% 0.63/0.57 % SZS output start Proof
% 0.63/0.57 cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 0.63/0.57 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 0.63/0.57 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 0.63/0.57 cnf(axiom_1_6, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_6)).
% 0.63/0.57 cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 0.63/0.57 cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_4)).
% 0.63/0.57 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 0.63/0.57 cnf(prove_this, negated_conjecture, (~theorem(implies(and(p,q),and(q,p)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 0.63/0.57 cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax', and_defn)).
% 0.63/0.57 cnf(c_0_9, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 0.63/0.57 cnf(c_0_10, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_9).
% 0.63/0.57 cnf(c_0_11, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 0.63/0.57 cnf(c_0_12, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.63/0.57 cnf(c_0_13, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_10, c_0_11])).
% 0.63/0.57 cnf(c_0_14, plain, (theorem(X1)|~axiom(X1)), c_0_12).
% 0.63/0.57 cnf(c_0_15, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 0.63/0.57 cnf(c_0_16, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
% 0.63/0.57 cnf(c_0_17, plain, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_11]), c_0_11]), c_0_11])).
% 0.63/0.57 cnf(c_0_18, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.63/0.57 cnf(c_0_19, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_13, c_0_18])).
% 0.63/0.57 cnf(c_0_20, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 0.63/0.57 cnf(c_0_21, plain, (theorem(or(X1,X2))|~theorem(or(X1,X3))|~axiom(or(not(X3),X2))), inference(spm,[status(thm)],[c_0_19, c_0_14])).
% 0.63/0.57 cnf(c_0_22, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_20, c_0_11])).
% 0.63/0.57 cnf(c_0_23, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 0.63/0.57 cnf(c_0_24, plain, (theorem(or(X1,X2))|~theorem(or(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.63/0.57 cnf(c_0_25, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 0.63/0.57 cnf(c_0_26, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))), inference(rw,[status(thm)],[c_0_23, c_0_11])).
% 0.63/0.57 cnf(c_0_27, plain, (theorem(or(X1,X2))|~axiom(or(X1,or(X2,X2)))), inference(spm,[status(thm)],[c_0_24, c_0_14])).
% 0.63/0.57 cnf(c_0_28, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_25, c_0_11])).
% 0.63/0.57 cnf(c_0_29, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_16, c_0_26])).
% 0.63/0.57 cnf(c_0_30, plain, (theorem(or(not(X1),X1))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 0.63/0.57 cnf(c_0_31, negated_conjecture, (~theorem(implies(and(p,q),and(q,p)))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.63/0.57 cnf(c_0_32, plain, (theorem(or(X1,not(X1)))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 0.63/0.57 cnf(c_0_33, negated_conjecture, (~theorem(implies(and(p,q),and(q,p)))), c_0_31).
% 0.63/0.57 cnf(c_0_34, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 0.63/0.57 cnf(c_0_35, plain, (theorem(or(X1,not(not(X2))))|~theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_19, c_0_32])).
% 0.63/0.57 cnf(c_0_36, negated_conjecture, (~theorem(or(not(not(or(not(p),not(q)))),not(or(not(q),not(p)))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_11]), c_0_34]), c_0_34])).
% 0.63/0.57 cnf(c_0_37, plain, (theorem(or(not(not(X1)),X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_29, c_0_35])).
% 0.63/0.57 cnf(c_0_38, negated_conjecture, (~theorem(or(not(or(not(q),not(p))),or(not(p),not(q))))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 0.63/0.57 cnf(c_0_39, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_14]), c_0_26])]), ['proof']).
% 0.63/0.57 % SZS output end Proof
% 0.63/0.57 % User time : 0.028 s
% 0.63/0.57 % System time : 0.004 s
% 0.63/0.57 % Total time : 0.032 s
% 0.63/0.57 % User time : 0.128 s
% 0.63/0.57 % System time : 0.015 s
% 0.63/0.57 % Total time : 0.144 s
% 0.63/0.57
%------------------------------------------------------------------------------