%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL276-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n027.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:41 AM UTC 2026
% Result : Unsatisfiable 2.66s 0.89s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL276-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 : n027.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 : Sat Sep 5 10:23:43 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.13/0.46 start to proof:theBenchmark.p
% 2.66/0.89 % Version : CSI_E---1.1
% 2.66/0.89 % Problem : theBenchmark.p
% 2.66/0.89 % Proof found!
% 2.66/0.89 # SZS status Unsatisfiable
% 2.66/0.89 % SZS output start Proof
% 2.66/0.89 cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 2.66/0.89 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 2.66/0.89 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 2.66/0.89 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)).
% 2.66/0.89 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)).
% 2.66/0.89 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)).
% 2.66/0.89 cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 2.66/0.89 cnf(prove_this, negated_conjecture, (~theorem(equivalent(or(r,or(p,q)),or(p,or(q,r))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 2.66/0.89 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)).
% 2.66/0.89 cnf(and_defn, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax', and_defn)).
% 2.66/0.89 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 2.66/0.89 cnf(c_0_11, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 2.66/0.89 cnf(c_0_12, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_11).
% 2.66/0.89 cnf(c_0_13, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 2.66/0.89 cnf(c_0_14, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 2.66/0.89 cnf(c_0_15, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_12, c_0_13])).
% 2.66/0.89 cnf(c_0_16, plain, (theorem(X1)|~axiom(X1)), c_0_14).
% 2.66/0.89 cnf(c_0_17, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), axiom_1_5).
% 2.66/0.89 cnf(c_0_18, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 2.66/0.89 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])).
% 2.66/0.89 cnf(c_0_20, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 2.66/0.89 cnf(c_0_21, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 2.66/0.89 cnf(c_0_22, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_20, c_0_16])).
% 2.66/0.89 cnf(c_0_23, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 2.66/0.89 cnf(c_0_24, 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_21, c_0_13]), c_0_13]), c_0_13])).
% 2.66/0.89 cnf(c_0_25, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 2.66/0.89 cnf(c_0_26, plain, (theorem(or(X1,X2))|~theorem(X3)|~axiom(or(X1,or(not(X3),X2)))), inference(spm,[status(thm)],[c_0_15, c_0_22])).
% 2.66/0.89 cnf(c_0_27, plain, (axiom(or(not(or(X1,X2)),or(X2,X1)))), inference(rw,[status(thm)],[c_0_23, c_0_13])).
% 2.66/0.89 cnf(c_0_28, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_18, c_0_24])).
% 2.66/0.89 cnf(c_0_29, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_25, c_0_13])).
% 2.66/0.89 cnf(c_0_30, negated_conjecture, (~theorem(equivalent(or(r,or(p,q)),or(p,or(q,r))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 2.66/0.89 cnf(c_0_31, axiom, (equivalent(X1,X2)=and(implies(X1,X2),implies(X2,X1))), equivalent_defn).
% 2.66/0.89 cnf(c_0_32, axiom, (and(X1,X2)=not(or(not(X1),not(X2)))), and_defn).
% 2.66/0.89 cnf(c_0_33, plain, (theorem(or(not(or(X1,not(X2))),X1))|~theorem(X2)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 2.66/0.89 cnf(c_0_34, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_15, c_0_28])).
% 2.66/0.89 cnf(c_0_35, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_18, c_0_29])).
% 2.66/0.89 cnf(c_0_36, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 2.66/0.89 cnf(c_0_37, negated_conjecture, (~theorem(equivalent(or(r,or(p,q)),or(p,or(q,r))))), c_0_30).
% 2.66/0.89 cnf(c_0_38, 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_31, c_0_13]), c_0_13]), c_0_32])).
% 2.66/0.89 cnf(c_0_39, plain, (theorem(X1)|~theorem(or(X1,not(X2)))|~theorem(X2)), inference(spm,[status(thm)],[c_0_15, c_0_33])).
% 2.66/0.89 cnf(c_0_40, plain, (theorem(or(X1,X2))|~theorem(or(X1,X3))|~axiom(or(not(X3),X2))), inference(spm,[status(thm)],[c_0_34, c_0_16])).
% 2.66/0.89 cnf(c_0_41, plain, (theorem(or(X1,X2))|~axiom(or(X1,or(or(X1,X2),X2)))), inference(spm,[status(thm)],[c_0_35, c_0_22])).
% 2.66/0.89 cnf(c_0_42, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_36, c_0_13])).
% 2.66/0.89 cnf(c_0_43, negated_conjecture, (~theorem(not(or(not(or(not(or(r,or(p,q))),or(p,or(q,r)))),not(or(not(or(p,or(q,r))),or(r,or(p,q)))))))), inference(rw,[status(thm)],[c_0_37, c_0_38])).
% 2.66/0.89 cnf(c_0_44, plain, (theorem(not(or(not(X1),not(X2))))|~theorem(X1)|~theorem(X2)), inference(spm,[status(thm)],[c_0_39, c_0_33])).
% 2.66/0.89 cnf(c_0_45, plain, (theorem(or(X1,or(X2,or(X3,X4))))|~theorem(or(X1,or(X3,or(X2,X4))))), inference(spm,[status(thm)],[c_0_40, c_0_19])).
% 2.66/0.89 cnf(c_0_46, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,or(X3,X2)))), inference(spm,[status(thm)],[c_0_40, c_0_27])).
% 2.66/0.89 cnf(c_0_47, plain, (theorem(or(not(X1),X1))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
% 2.66/0.89 cnf(c_0_48, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,or(X2,X4)))|~theorem(or(not(X4),X3))), inference(spm,[status(thm)],[c_0_34, c_0_28])).
% 2.66/0.89 cnf(c_0_49, negated_conjecture, (~theorem(or(not(or(r,or(p,q))),or(p,or(q,r))))|~theorem(or(not(or(p,or(q,r))),or(r,or(p,q))))), inference(spm,[status(thm)],[c_0_43, c_0_44])).
% 2.66/0.89 cnf(c_0_50, plain, (theorem(or(not(or(X1,X2)),or(X3,or(X1,X4))))|~theorem(or(not(X2),or(X3,X4)))), inference(spm,[status(thm)],[c_0_45, c_0_28])).
% 2.66/0.89 cnf(c_0_51, plain, (theorem(or(not(or(X1,X2)),or(X2,X1)))), inference(spm,[status(thm)],[c_0_46, c_0_47])).
% 2.66/0.89 cnf(c_0_52, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(not(X4),X3))|~axiom(or(X1,or(X2,X4)))), inference(spm,[status(thm)],[c_0_48, c_0_16])).
% 2.66/0.89 cnf(c_0_53, negated_conjecture, (~theorem(or(not(or(r,or(p,q))),or(p,or(q,r))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51])])).
% 2.66/0.89 cnf(c_0_54, plain, (theorem(or(not(or(X1,or(X2,X3))),or(X2,X4)))|~theorem(or(not(or(X1,X3)),X4))), inference(spm,[status(thm)],[c_0_52, c_0_19])).
% 2.66/0.89 cnf(c_0_55, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_51])]), ['proof']).
% 2.66/0.89 % SZS output end Proof
% 2.66/0.89 % User time : 0.387 s
% 2.66/0.89 % System time : 0.017 s
% 2.66/0.89 % Total time : 0.405 s
% 2.66/0.89 % User time : 1.767 s
% 2.66/0.89 % System time : 0.053 s
% 2.66/0.89 % Total time : 1.820 s
% 2.66/0.89
%------------------------------------------------------------------------------