%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL231-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n018.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:36 AM UTC 2026
% Result : Unsatisfiable 3.30s 0.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL231-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 : n018.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 : Sun Sep 6 00:13:34 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.12/0.42 start to proof:theBenchmark.p
% 3.30/0.91 % Version : CSI_E---1.1
% 3.30/0.91 % Problem : theBenchmark.p
% 3.30/0.91 % Proof found!
% 3.30/0.91 # SZS status Unsatisfiable
% 3.30/0.91 % SZS output start Proof
% 3.30/0.91 cnf(rule_2, axiom, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_2)).
% 3.30/0.91 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 3.30/0.91 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 3.30/0.91 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)).
% 3.30/0.91 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)).
% 3.30/0.91 cnf(axiom_1_3, axiom, (axiom(implies(X1,or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_3)).
% 3.30/0.91 cnf(axiom_1_2, axiom, (axiom(implies(or(X1,X1),X1))), file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax', axiom_1_2)).
% 3.30/0.91 cnf(prove_this, negated_conjecture, (~theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 3.30/0.91 cnf(c_0_8, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 3.30/0.91 cnf(c_0_9, plain, (theorem(X1)|~theorem(implies(X2,X1))|~theorem(X2)), c_0_8).
% 3.30/0.91 cnf(c_0_10, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 3.30/0.91 cnf(c_0_11, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 3.30/0.91 cnf(c_0_12, plain, (theorem(X1)|~theorem(X2)|~theorem(or(not(X2),X1))), inference(rw,[status(thm)],[c_0_9, c_0_10])).
% 3.30/0.91 cnf(c_0_13, plain, (theorem(X1)|~axiom(X1)), c_0_11).
% 3.30/0.91 cnf(c_0_14, axiom, (axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2))))), axiom_1_6).
% 3.30/0.91 cnf(c_0_15, axiom, (axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3))))), axiom_1_5).
% 3.30/0.91 cnf(c_0_16, axiom, (axiom(implies(X1,or(X2,X1)))), axiom_1_3).
% 3.30/0.91 cnf(c_0_17, plain, (theorem(X1)|~theorem(X2)|~axiom(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 3.30/0.91 cnf(c_0_18, 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_14, c_0_10]), c_0_10]), c_0_10])).
% 3.30/0.91 cnf(c_0_19, axiom, (axiom(implies(or(X1,X1),X1))), axiom_1_2).
% 3.30/0.91 cnf(c_0_20, plain, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), inference(rw,[status(thm)],[c_0_15, c_0_10])).
% 3.30/0.91 cnf(c_0_21, plain, (axiom(or(not(X1),or(X2,X1)))), inference(rw,[status(thm)],[c_0_16, c_0_10])).
% 3.30/0.91 cnf(c_0_22, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 3.30/0.91 cnf(c_0_23, plain, (axiom(or(not(or(X1,X1)),X1))), inference(rw,[status(thm)],[c_0_19, c_0_10])).
% 3.30/0.91 cnf(c_0_24, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_17, c_0_20])).
% 3.30/0.91 cnf(c_0_25, plain, (theorem(or(X1,X2))|~theorem(X2)), inference(spm,[status(thm)],[c_0_17, c_0_21])).
% 3.30/0.91 cnf(c_0_26, plain, (theorem(or(X1,X2))|~theorem(or(not(X3),X2))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_12, c_0_22])).
% 3.30/0.91 cnf(c_0_27, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_17, c_0_23])).
% 3.30/0.91 cnf(c_0_28, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_24, c_0_25])).
% 3.30/0.91 cnf(c_0_29, negated_conjecture, (~theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 3.30/0.91 cnf(c_0_30, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,or(X2,X4)))|~theorem(or(not(X4),X3))), inference(spm,[status(thm)],[c_0_26, c_0_22])).
% 3.30/0.91 cnf(c_0_31, plain, (theorem(or(X1,X2))|~theorem(or(or(X1,X2),X2))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 3.30/0.91 cnf(c_0_32, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_24, c_0_13])).
% 3.30/0.91 cnf(c_0_33, negated_conjecture, (~theorem(implies(implies(implies(p,q),implies(p,r)),implies(p,implies(q,r))))), c_0_29).
% 3.30/0.91 cnf(c_0_34, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(not(X4),X3))|~axiom(or(X1,or(X2,X4)))), inference(spm,[status(thm)],[c_0_30, c_0_13])).
% 3.30/0.91 cnf(c_0_35, plain, (theorem(or(X1,or(X2,X3)))|~axiom(or(X2,or(or(X1,or(X2,X3)),X3)))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 3.30/0.91 cnf(c_0_36, negated_conjecture, (~theorem(or(not(or(not(or(not(p),q)),or(not(p),r))),or(not(p),or(not(q),r))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_10]), c_0_10]), c_0_10]), c_0_10]), c_0_10]), c_0_10])).
% 3.30/0.91 cnf(c_0_37, 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_34, c_0_20])).
% 3.30/0.91 cnf(c_0_38, plain, (theorem(or(X1,X2))|~theorem(X3)|~axiom(or(X1,or(not(X3),X2)))), inference(spm,[status(thm)],[c_0_12, c_0_32])).
% 3.30/0.91 cnf(c_0_39, plain, (theorem(or(X1,or(not(X2),X2)))), inference(spm,[status(thm)],[c_0_35, c_0_21])).
% 3.30/0.91 cnf(c_0_40, negated_conjecture, (~theorem(or(not(or(not(or(not(p),q)),r)),or(not(q),r)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 3.30/0.91 cnf(c_0_41, plain, (theorem(or(not(or(not(X1),X2)),or(X3,X2)))|~theorem(or(X3,X1))), inference(spm,[status(thm)],[c_0_38, c_0_18])).
% 3.30/0.91 cnf(c_0_42, plain, (theorem(or(not(X1),or(X2,X1)))), inference(spm,[status(thm)],[c_0_24, c_0_39])).
% 3.30/0.91 cnf(c_0_43, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])]), ['proof']).
% 3.30/0.91 % SZS output end Proof
% 3.30/0.91 % User time : 0.434 s
% 3.30/0.91 % System time : 0.029 s
% 3.30/0.91 % Total time : 0.463 s
% 3.30/0.91 % User time : 2.117 s
% 3.30/0.91 % System time : 0.061 s
% 3.30/0.91 % Total time : 2.178 s
% 3.30/0.91
%------------------------------------------------------------------------------