%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL227-1 : TPTP v9.3.1. Released v1.1.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:35 AM UTC 2026
% Result : Unsatisfiable 7.55s 1.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL227-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.10/0.35 % Computer : n020.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 5 10:58:57 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.24/0.47 start to proof:theBenchmark.p
% 7.55/1.53 % Version : CSI_E---1.1
% 7.55/1.53 % Problem : theBenchmark.p
% 7.55/1.53 % Proof found!
% 7.55/1.53 # SZS status Unsatisfiable
% 7.55/1.53 % SZS output start Proof
% 7.55/1.53 cnf(rule_2, axiom, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_2)).
% 7.55/1.53 cnf(axiom_1_5, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_5)).
% 7.55/1.53 cnf(axiom_1_3, axiom, (axiom(or(not(X1),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_3)).
% 7.55/1.53 cnf(axiom_1_4, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_4)).
% 7.55/1.53 cnf(axiom_1_2, axiom, (axiom(or(not(or(X1,X1)),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_2)).
% 7.55/1.53 cnf(rule_3, axiom, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_3)).
% 7.55/1.53 cnf(axiom_1_6, axiom, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_6)).
% 7.55/1.53 cnf(prove_this, negated_conjecture, (~theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 7.55/1.53 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_1)).
% 7.55/1.53 cnf(c_0_9, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 7.55/1.53 cnf(c_0_10, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), c_0_9).
% 7.55/1.53 cnf(c_0_11, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), axiom_1_5).
% 7.55/1.53 cnf(c_0_12, axiom, (axiom(or(not(X1),or(X2,X1)))), axiom_1_3).
% 7.55/1.53 cnf(c_0_13, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), axiom_1_4).
% 7.55/1.53 cnf(c_0_14, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
% 7.55/1.53 cnf(c_0_15, plain, (theorem(or(X1,X2))|~theorem(X2)), inference(spm,[status(thm)],[c_0_10, c_0_12])).
% 7.55/1.53 cnf(c_0_16, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_10, c_0_13])).
% 7.55/1.53 cnf(c_0_17, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X1,X3))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 7.55/1.53 cnf(c_0_18, axiom, (axiom(or(not(or(X1,X1)),X1))), axiom_1_2).
% 7.55/1.53 cnf(c_0_19, plain, (theorem(or(or(X1,X2),X3))|~theorem(or(X3,X2))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 7.55/1.53 cnf(c_0_20, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), inference(fof_simplification,[status(thm)],[rule_3])).
% 7.55/1.53 cnf(c_0_21, plain, (theorem(X1)|~theorem(or(X1,X1))), inference(spm,[status(thm)],[c_0_10, c_0_18])).
% 7.55/1.53 cnf(c_0_22, plain, (theorem(or(X1,or(or(X2,X3),X4)))|~theorem(or(or(X1,X4),X3))), inference(spm,[status(thm)],[c_0_14, c_0_19])).
% 7.55/1.53 cnf(c_0_23, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), c_0_20).
% 7.55/1.53 cnf(c_0_24, axiom, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))), axiom_1_6).
% 7.55/1.53 cnf(c_0_25, plain, (theorem(or(or(X1,X2),X3))|~theorem(or(or(or(or(X1,X2),X3),X3),X2))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 7.55/1.53 cnf(c_0_26, negated_conjecture, (~theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s)))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 7.55/1.53 cnf(c_0_27, plain, (theorem(or(not(or(not(X1),X2)),X3))|~theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 7.55/1.53 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_10, c_0_24])).
% 7.55/1.53 cnf(c_0_29, plain, (theorem(or(or(X1,X2),X3))|~theorem(or(X2,X3))), inference(spm,[status(thm)],[c_0_25, c_0_19])).
% 7.55/1.53 cnf(c_0_30, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 7.55/1.53 cnf(c_0_31, negated_conjecture, (~theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s)))))), c_0_26).
% 7.55/1.53 cnf(c_0_32, plain, (theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),X4)))|~theorem(or(not(or(X3,X2)),X4))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
% 7.55/1.53 cnf(c_0_33, plain, (theorem(or(not(or(X1,or(X2,X3))),X4))|~theorem(or(not(or(X2,or(X1,X3))),X4))), inference(spm,[status(thm)],[c_0_23, c_0_11])).
% 7.55/1.53 cnf(c_0_34, plain, (theorem(or(X1,X2))|~theorem(or(X2,or(X1,X2)))), inference(spm,[status(thm)],[c_0_21, c_0_29])).
% 7.55/1.53 cnf(c_0_35, plain, (theorem(or(X1,or(not(or(X1,X2)),X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_14, c_0_28])).
% 7.55/1.53 cnf(c_0_36, plain, (theorem(or(not(X1),X2))|~theorem(or(not(or(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_23, c_0_12])).
% 7.55/1.53 cnf(c_0_37, plain, (theorem(X1)|~axiom(X1)), c_0_30).
% 7.55/1.53 cnf(c_0_38, negated_conjecture, (~theorem(or(not(or(p,or(not(r),s))),or(not(or(p,r)),or(p,s))))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 7.55/1.53 cnf(c_0_39, plain, (theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X4,X2)),X5)))|~theorem(or(not(or(X4,or(X1,X3))),X5))), inference(spm,[status(thm)],[c_0_33, c_0_32])).
% 7.55/1.53 cnf(c_0_40, plain, (theorem(or(not(or(X1,X2)),X3))|~theorem(or(not(or(X2,X1)),X3))), inference(spm,[status(thm)],[c_0_23, c_0_13])).
% 7.55/1.53 cnf(c_0_41, plain, (theorem(or(not(or(X1,X2)),X1))|~theorem(or(not(X2),X1))), inference(spm,[status(thm)],[c_0_34, c_0_35])).
% 7.55/1.53 cnf(c_0_42, plain, (theorem(or(not(X1),X2))|~axiom(or(not(or(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 7.55/1.53 cnf(c_0_43, negated_conjecture, (~theorem(or(not(or(p,or(p,s))),or(p,s)))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
% 7.55/1.53 cnf(c_0_44, plain, (theorem(or(not(or(X1,X2)),X2))|~theorem(or(not(X1),X2))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
% 7.55/1.53 cnf(c_0_45, plain, (theorem(or(not(X1),or(X1,X2)))), inference(spm,[status(thm)],[c_0_42, c_0_13])).
% 7.55/1.53 cnf(c_0_46, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45])]), ['proof']).
% 7.55/1.53 % SZS output end Proof
% 7.55/1.53 % User time : 0.656 s
% 7.55/1.53 % System time : 0.034 s
% 7.55/1.53 % Total time : 0.690 s
% 7.55/1.53 % User time : 4.217 s
% 7.55/1.53 % System time : 0.127 s
% 7.55/1.53 % Total time : 4.345 s
% 7.55/1.53
%------------------------------------------------------------------------------