%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n006.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:32 AM UTC 2026
% Result : Unsatisfiable 0.92s 0.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL211-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.35 % Computer : n006.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Fri Sep 4 19:28:31 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.25/0.47 start to proof:theBenchmark.p
% 0.92/0.60 % Version : CSI_E---1.1
% 0.92/0.60 % Problem : theBenchmark.p
% 0.92/0.60 % Proof found!
% 0.92/0.60 # SZS status Unsatisfiable
% 0.92/0.60 % SZS output start Proof
% 0.92/0.60 cnf(rule_2, axiom, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_2)).
% 0.92/0.60 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)).
% 0.92/0.60 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_1)).
% 0.92/0.60 cnf(axiom_1_2, axiom, (axiom(or(not(or(X1,X1)),X1))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_2)).
% 0.92/0.60 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)).
% 0.92/0.60 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)).
% 0.92/0.60 cnf(axiom_1_3, axiom, (axiom(or(not(X1),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', axiom_1_3)).
% 0.92/0.60 cnf(prove_this, negated_conjecture, (~theorem(or(not(not(q)),or(not(or(p,q)),p)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.92/0.60 cnf(c_0_8, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 0.92/0.60 cnf(c_0_9, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), c_0_8).
% 0.92/0.60 cnf(c_0_10, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), axiom_1_4).
% 0.92/0.60 cnf(c_0_11, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.92/0.60 cnf(c_0_12, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.92/0.60 cnf(c_0_13, plain, (theorem(X1)|~axiom(X1)), c_0_11).
% 0.92/0.60 cnf(c_0_14, plain, (theorem(or(X1,X2))|~axiom(or(X2,X1))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.92/0.60 cnf(c_0_15, axiom, (axiom(or(not(or(X1,X1)),X1))), axiom_1_2).
% 0.92/0.60 cnf(c_0_16, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), inference(fof_simplification,[status(thm)],[rule_3])).
% 0.92/0.60 cnf(c_0_17, axiom, (axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2))))), axiom_1_6).
% 0.92/0.60 cnf(c_0_18, plain, (theorem(or(X1,not(or(X1,X1))))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.92/0.60 cnf(c_0_19, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), c_0_16).
% 0.92/0.60 cnf(c_0_20, plain, (theorem(or(not(or(X1,X2)),or(X1,X3)))|~theorem(or(not(X2),X3))), inference(spm,[status(thm)],[c_0_9, c_0_17])).
% 0.92/0.60 cnf(c_0_21, plain, (theorem(or(not(or(X1,X1)),X1))), inference(spm,[status(thm)],[c_0_12, c_0_18])).
% 0.92/0.60 cnf(c_0_22, 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_19, c_0_17])).
% 0.92/0.60 cnf(c_0_23, plain, (theorem(or(not(or(X1,or(X2,X2))),or(X1,X2)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.92/0.60 cnf(c_0_24, axiom, (axiom(or(not(X1),or(X2,X1)))), axiom_1_3).
% 0.92/0.60 cnf(c_0_25, plain, (theorem(or(not(or(X1,X2)),X3))|~theorem(or(not(or(X2,X1)),X3))), inference(spm,[status(thm)],[c_0_19, c_0_10])).
% 0.92/0.60 cnf(c_0_26, plain, (theorem(or(not(or(not(X1),X2)),or(not(or(X2,X1)),X2)))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
% 0.92/0.60 cnf(c_0_27, negated_conjecture, (~theorem(or(not(not(q)),or(not(or(p,q)),p)))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.92/0.60 cnf(c_0_28, plain, (theorem(or(not(X1),X2))|~theorem(or(not(or(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_19, c_0_24])).
% 0.92/0.60 cnf(c_0_29, plain, (theorem(or(not(or(X1,not(X2))),or(not(or(X1,X2)),X1)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
% 0.92/0.60 cnf(c_0_30, negated_conjecture, (~theorem(or(not(not(q)),or(not(or(p,q)),p)))), c_0_27).
% 0.92/0.60 cnf(c_0_31, plain, (theorem(or(not(not(X1)),or(not(or(X2,X1)),X2)))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
% 0.92/0.60 cnf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_31])]), ['proof']).
% 0.92/0.60 % SZS output end Proof
% 0.92/0.60 % User time : 0.063 s
% 0.92/0.60 % System time : 0.009 s
% 0.92/0.60 % Total time : 0.072 s
% 0.92/0.60 % User time : 0.064 s
% 0.92/0.60 % System time : 0.013 s
% 0.92/0.60 % Total time : 0.077 s
% 0.92/0.60
%------------------------------------------------------------------------------