%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL295-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n004.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:42 AM UTC 2026
% Result : Unsatisfiable 12.32s 2.13s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL295-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n004.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sat Sep 5 01:30:14 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.24/0.46 start to proof:theBenchmark.p
% 12.32/2.13 % Version : CSI_E---1.1
% 12.32/2.13 % Problem : theBenchmark.p
% 12.32/2.13 % Proof found!
% 12.32/2.13 # SZS status Unsatisfiable
% 12.32/2.13 % SZS output start Proof
% 12.32/2.13 cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 12.32/2.13 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 12.32/2.13 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 12.32/2.13 cnf(axiom_1_5, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_5)).
% 12.32/2.13 cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 12.32/2.13 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)).
% 12.32/2.13 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)).
% 12.32/2.13 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 12.32/2.13 cnf(prove_this, negated_conjecture, (~theorem(equivalent(not(implies(p,q)),and(p,not(q))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 12.32/2.13 cnf(equivalent_defn, axiom, (equivalent(X1,X2)=and(implies(X1,X2),implies(X2,X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax', equivalent_defn)).
% 12.32/2.13 cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax', and_defn)).
% 12.32/2.13 cnf(c_0_11, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 12.32/2.13 cnf(c_0_12, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_11).
% 12.32/2.13 cnf(c_0_13, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 12.32/2.13 cnf(c_0_14, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 12.32/2.13 cnf(c_0_15, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_12, c_0_13])).
% 12.32/2.13 cnf(c_0_16, plain, (theorem(X1)|~axiom(X1)), c_0_14).
% 12.32/2.13 cnf(c_0_17, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), axiom_1_5).
% 12.32/2.13 cnf(c_0_18, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 12.32/2.13 cnf(c_0_19, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), inference(rw,[status(thm)],[c_0_17, c_0_13])).
% 12.32/2.13 cnf(c_0_20, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 12.32/2.13 cnf(c_0_21, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 12.32/2.13 cnf(c_0_22, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_20, c_0_13])).
% 12.32/2.13 cnf(c_0_23, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_21, c_0_16])).
% 12.32/2.13 cnf(c_0_24, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 12.32/2.13 cnf(c_0_25, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 12.32/2.13 cnf(c_0_26, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_18, c_0_22])).
% 12.32/2.13 cnf(c_0_27, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 12.32/2.13 cnf(c_0_28, plain, (theorem(or(X1,X2))|~theorem(X3)|~axiom(or(X1,or(not(X3),X2)))), inference(spm,[status(thm)],[c_0_15, c_0_23])).
% 12.32/2.13 cnf(c_0_29, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))), inference(rw,[status(thm)],[c_0_24, c_0_13])).
% 12.32/2.13 cnf(c_0_30, 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_25, c_0_13]), c_0_13]), c_0_13])).
% 12.32/2.13 cnf(c_0_31, plain, (theorem(or(X1,X2))|~axiom(or(X1,or(or(X1,X2),X2)))), inference(spm,[status(thm)],[c_0_26, c_0_23])).
% 12.32/2.13 cnf(c_0_32, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_27, c_0_13])).
% 12.32/2.13 cnf(c_0_33, negated_conjecture, (~theorem(equivalent(not(implies(p,q)),and(p,not(q))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 12.32/2.13 cnf(c_0_34, axiom, (equivalent(X1,X2)=and(implies(X1,X2),implies(X2,X1))), equivalent_defn).
% 12.32/2.13 cnf(c_0_35, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 12.32/2.13 cnf(c_0_36, plain, (theorem(or(not(or(X1,not(X2))),X1))|~theorem(X2)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
% 12.32/2.13 cnf(c_0_37, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_18, c_0_30])).
% 12.32/2.13 cnf(c_0_38, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_18, c_0_29])).
% 12.32/2.13 cnf(c_0_39, plain, (theorem(or(not(X1),X1))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 12.32/2.13 cnf(c_0_40, negated_conjecture, (~theorem(equivalent(not(implies(p,q)),and(p,not(q))))), c_0_33).
% 12.32/2.13 cnf(c_0_41, plain, (equivalent(X1,X2)=not(or(not(or(not(X1),X2)),not(or(not(X2),X1))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_13]), c_0_13]), c_0_35])).
% 12.32/2.13 cnf(c_0_42, plain, (theorem(X1)|~theorem(or(X1,not(X2)))|~theorem(X2)), inference(spm,[status(thm)],[c_0_15, c_0_36])).
% 12.32/2.13 cnf(c_0_43, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_15, c_0_37])).
% 12.32/2.13 cnf(c_0_44, plain, (theorem(or(X1,not(X1)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 12.32/2.13 cnf(c_0_45, negated_conjecture, (~theorem(not(or(not(or(not(not(or(not(p),q))),not(or(not(p),not(not(q)))))),not(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q)))))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_13]), c_0_35]), c_0_41])).
% 12.32/2.13 cnf(c_0_46, plain, (theorem(not(or(not(X1),not(X2))))|~theorem(X1)|~theorem(X2)), inference(spm,[status(thm)],[c_0_42, c_0_36])).
% 12.32/2.13 cnf(c_0_47, plain, (theorem(or(X1,not(not(X2))))|~theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_43, c_0_44])).
% 12.32/2.13 cnf(c_0_48, negated_conjecture, (~theorem(or(not(not(or(not(p),q))),not(or(not(p),not(not(q))))))|~theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q))))), inference(spm,[status(thm)],[c_0_45, c_0_46])).
% 12.32/2.13 cnf(c_0_49, plain, (theorem(or(not(not(X1)),X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_38, c_0_47])).
% 12.32/2.13 cnf(c_0_50, negated_conjecture, (~theorem(or(not(not(or(not(p),q))),not(or(not(p),not(not(q))))))|~theorem(or(not(or(not(p),q)),or(not(p),not(not(q)))))), inference(spm,[status(thm)],[c_0_48, c_0_49])).
% 12.32/2.13 cnf(c_0_51, negated_conjecture, (~theorem(or(not(or(not(p),q)),or(not(p),not(not(q)))))|~theorem(or(not(or(not(p),not(not(q)))),or(not(p),q)))), inference(spm,[status(thm)],[c_0_50, c_0_49])).
% 12.32/2.13 cnf(c_0_52, negated_conjecture, (~theorem(or(not(or(not(p),q)),or(not(p),not(not(q)))))|~theorem(or(not(not(not(q))),q))), inference(spm,[status(thm)],[c_0_51, c_0_37])).
% 12.32/2.13 cnf(c_0_53, negated_conjecture, (~theorem(or(not(not(not(q))),q))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_37]), c_0_44])])).
% 12.32/2.13 cnf(c_0_54, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_49]), c_0_44])]), ['proof']).
% 12.32/2.13 % SZS output end Proof
% 12.32/2.13 % User time : 1.553 s
% 12.32/2.13 % System time : 0.065 s
% 12.32/2.13 % Total time : 1.618 s
% 12.32/2.13 % User time : 7.523 s
% 12.32/2.13 % System time : 0.169 s
% 12.32/2.13 % Total time : 7.691 s
% 12.32/2.13
%------------------------------------------------------------------------------