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