%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL347-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n014.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:47 AM UTC 2026
% Result : Unsatisfiable 10.95s 2.05s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL347-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Fri Sep 4 15:32:13 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.14/0.46 start to proof:theBenchmark.p
% 10.95/2.05 % Version : CSI_E---1.1
% 10.95/2.05 % Problem : theBenchmark.p
% 10.95/2.05 % Proof found!
% 10.95/2.05 # SZS status Unsatisfiable
% 10.95/2.05 % SZS output start Proof
% 10.95/2.05 cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 10.95/2.05 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 10.95/2.05 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 10.95/2.05 cnf(axiom_1_5, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_5)).
% 10.95/2.05 cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 10.95/2.05 cnf(axiom_1_6, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_6)).
% 10.95/2.05 cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_4)).
% 10.95/2.05 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 10.95/2.05 cnf(prove_this, negated_conjecture, (~theorem(equivalent(and(or(p,q),not(q)),and(p,not(q))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 10.95/2.05 cnf(equivalent_defn, axiom, (equivalent(X1,X2)=and(implies(X1,X2),implies(X2,X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax', equivalent_defn)).
% 10.95/2.05 cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax', and_defn)).
% 10.95/2.05 cnf(c_0_11, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 10.95/2.05 cnf(c_0_12, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_11).
% 10.95/2.05 cnf(c_0_13, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 10.95/2.05 cnf(c_0_14, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 10.95/2.05 cnf(c_0_15, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_12, c_0_13])).
% 10.95/2.05 cnf(c_0_16, plain, (theorem(X1)|~axiom(X1)), c_0_14).
% 10.95/2.05 cnf(c_0_17, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), axiom_1_5).
% 10.95/2.05 cnf(c_0_18, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 10.95/2.05 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])).
% 10.95/2.05 cnf(c_0_20, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 10.95/2.05 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])).
% 10.95/2.05 cnf(c_0_22, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_20, c_0_13])).
% 10.95/2.05 cnf(c_0_23, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 10.95/2.05 cnf(c_0_24, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_21, c_0_16])).
% 10.95/2.05 cnf(c_0_25, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 10.95/2.05 cnf(c_0_26, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_18, c_0_22])).
% 10.95/2.05 cnf(c_0_27, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 10.95/2.05 cnf(c_0_28, 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_23, c_0_13]), c_0_13]), c_0_13])).
% 10.95/2.05 cnf(c_0_29, plain, (theorem(or(X1,X2))|~theorem(X3)|~axiom(or(X1,or(not(X3),X2)))), inference(spm,[status(thm)],[c_0_15, c_0_24])).
% 10.95/2.05 cnf(c_0_30, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))), inference(rw,[status(thm)],[c_0_25, c_0_13])).
% 10.95/2.05 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_24])).
% 10.95/2.05 cnf(c_0_32, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_27, c_0_13])).
% 10.95/2.05 cnf(c_0_33, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_18, c_0_28])).
% 10.95/2.05 cnf(c_0_34, negated_conjecture, (~theorem(equivalent(and(or(p,q),not(q)),and(p,not(q))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 10.95/2.05 cnf(c_0_35, axiom, (equivalent(X1,X2)=and(implies(X1,X2),implies(X2,X1))), equivalent_defn).
% 10.95/2.05 cnf(c_0_36, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 10.95/2.05 cnf(c_0_37, plain, (theorem(or(not(or(X1,not(X2))),X1))|~theorem(X2)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 10.95/2.05 cnf(c_0_38, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_18, c_0_30])).
% 10.95/2.05 cnf(c_0_39, plain, (theorem(or(not(X1),X1))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 10.95/2.05 cnf(c_0_40, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_15, c_0_33])).
% 10.95/2.05 cnf(c_0_41, negated_conjecture, (~theorem(equivalent(and(or(p,q),not(q)),and(p,not(q))))), c_0_34).
% 10.95/2.05 cnf(c_0_42, 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_35, c_0_13]), c_0_13]), c_0_36])).
% 10.95/2.05 cnf(c_0_43, plain, (theorem(X1)|~theorem(or(X1,not(X2)))|~theorem(X2)), inference(spm,[status(thm)],[c_0_15, c_0_37])).
% 10.95/2.05 cnf(c_0_44, plain, (theorem(or(X1,not(X1)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 10.95/2.05 cnf(c_0_45, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,X4))|~axiom(or(X2,or(not(X4),X3)))), inference(spm,[status(thm)],[c_0_40, c_0_24])).
% 10.95/2.05 cnf(c_0_46, negated_conjecture, (~theorem(not(or(not(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q)))))),not(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q)))))))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41, c_0_36]), c_0_36]), c_0_42])).
% 10.95/2.05 cnf(c_0_47, plain, (theorem(not(or(not(X1),not(X2))))|~theorem(X1)|~theorem(X2)), inference(spm,[status(thm)],[c_0_43, c_0_37])).
% 10.95/2.05 cnf(c_0_48, plain, (theorem(or(X1,not(not(X2))))|~theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_40, c_0_44])).
% 10.95/2.05 cnf(c_0_49, plain, (theorem(or(X1,or(not(X2),X2)))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_45, c_0_32])).
% 10.95/2.05 cnf(c_0_50, negated_conjecture, (~theorem(or(not(not(or(not(or(p,q)),not(not(q))))),not(or(not(p),not(not(q))))))|~theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q))))))), inference(spm,[status(thm)],[c_0_46, c_0_47])).
% 10.95/2.05 cnf(c_0_51, plain, (theorem(or(not(not(X1)),X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_38, c_0_48])).
% 10.95/2.05 cnf(c_0_52, plain, (theorem(or(X1,X2))|~theorem(or(X1,X3))|~axiom(or(not(X3),X2))), inference(spm,[status(thm)],[c_0_40, c_0_16])).
% 10.95/2.05 cnf(c_0_53, plain, (theorem(or(X1,or(not(X2),X2)))), inference(spm,[status(thm)],[c_0_49, c_0_44])).
% 10.95/2.05 cnf(c_0_54, plain, (theorem(or(X1,X2))|~theorem(X2)), inference(spm,[status(thm)],[c_0_18, c_0_32])).
% 10.95/2.05 cnf(c_0_55, plain, (theorem(or(X1,or(not(or(X1,X2)),X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_21, c_0_33])).
% 10.95/2.05 cnf(c_0_56, negated_conjecture, (~theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(or(p,q)),not(not(q))))))|~theorem(or(not(or(not(p),not(not(q)))),or(not(or(p,q)),not(not(q)))))), inference(spm,[status(thm)],[c_0_50, c_0_51])).
% 10.95/2.05 cnf(c_0_57, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,or(X3,X2)))), inference(spm,[status(thm)],[c_0_52, c_0_30])).
% 10.95/2.05 cnf(c_0_58, plain, (theorem(or(not(X1),or(X2,X1)))), inference(spm,[status(thm)],[c_0_21, c_0_53])).
% 10.95/2.05 cnf(c_0_59, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_21, c_0_54])).
% 10.95/2.05 cnf(c_0_60, plain, (theorem(or(X1,or(not(or(not(X2),X3)),X4)))|~theorem(or(not(X3),X4))|~theorem(or(X1,X2))), inference(spm,[status(thm)],[c_0_40, c_0_55])).
% 10.95/2.05 cnf(c_0_61, negated_conjecture, (~theorem(or(not(or(not(p),not(not(q)))),or(not(or(p,q)),not(not(q)))))|~theorem(or(not(or(not(or(p,q)),not(not(q)))),or(not(p),not(not(q)))))), inference(spm,[status(thm)],[c_0_56, c_0_51])).
% 10.95/2.05 cnf(c_0_62, plain, (theorem(or(not(or(not(X1),X2)),or(X3,X2)))|~theorem(or(X3,X1))), inference(spm,[status(thm)],[c_0_29, c_0_28])).
% 10.95/2.05 cnf(c_0_63, plain, (theorem(or(not(X1),or(X1,X2)))), inference(spm,[status(thm)],[c_0_57, c_0_58])).
% 10.95/2.05 cnf(c_0_64, plain, (theorem(or(X1,X2))|~theorem(or(or(X1,X2),X2))), inference(spm,[status(thm)],[c_0_26, c_0_59])).
% 10.95/2.05 cnf(c_0_65, plain, (theorem(or(or(not(or(not(X1),X2)),X3),X4))|~theorem(or(not(X2),X3))|~theorem(or(X4,X1))), inference(spm,[status(thm)],[c_0_38, c_0_60])).
% 10.95/2.05 cnf(c_0_66, negated_conjecture, (~theorem(or(not(or(not(p),not(not(q)))),or(not(or(p,q)),not(not(q)))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61, c_0_62]), c_0_63])])).
% 10.95/2.05 cnf(c_0_67, plain, (theorem(or(not(or(not(X1),X2)),X3))|~theorem(or(not(X2),X3))|~theorem(or(X3,X1))), inference(spm,[status(thm)],[c_0_64, c_0_65])).
% 10.95/2.05 cnf(c_0_68, negated_conjecture, (~theorem(or(or(not(or(p,q)),not(not(q))),p))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66, c_0_67]), c_0_58])])).
% 10.95/2.05 cnf(c_0_69, plain, (theorem(or(or(not(or(X1,X2)),X3),X1))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_38, c_0_55])).
% 10.95/2.05 cnf(c_0_70, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68, c_0_69]), c_0_44])]), ['proof']).
% 10.95/2.05 % SZS output end Proof
% 10.95/2.05 % User time : 1.450 s
% 10.95/2.05 % System time : 0.062 s
% 10.95/2.05 % Total time : 1.513 s
% 10.95/2.05 % User time : 7.350 s
% 10.95/2.05 % System time : 0.184 s
% 10.95/2.05 % Total time : 7.535 s
% 10.95/2.05
%------------------------------------------------------------------------------