%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL201-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n002.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:31 AM UTC 2026
% Result : Unsatisfiable 0.77s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL201-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.35 % Computer : n002.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 5 02:59:20 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.14/0.47 start to proof:theBenchmark.p
% 0.77/0.59 % Version : CSI_E---1.1
% 0.77/0.59 % Problem : theBenchmark.p
% 0.77/0.59 % Proof found!
% 0.77/0.59 # SZS status Unsatisfiable
% 0.77/0.59 % SZS output start Proof
% 0.77/0.59 cnf(rule_2, axiom, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', rule_2)).
% 0.77/0.59 cnf(axiom_1_4, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', axiom_1_4)).
% 0.77/0.59 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', rule_1)).
% 0.77/0.59 cnf(rule_3, axiom, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', rule_3)).
% 0.77/0.59 cnf(axiom_1_3, axiom, (axiom(or(not(X1),or(X2,X1)))), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', axiom_1_3)).
% 0.77/0.59 cnf(axiom_1_5, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax', axiom_1_5)).
% 0.77/0.59 cnf(prove_this, negated_conjecture, (~theorem(or(not(not(or(p,q))),or(not(p),q)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_this)).
% 0.77/0.59 cnf(c_0_7, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), inference(fof_simplification,[status(thm)],[rule_2])).
% 0.77/0.59 cnf(c_0_8, plain, (theorem(X1)|~axiom(or(not(X2),X1))|~theorem(X2)), c_0_7).
% 0.77/0.59 cnf(c_0_9, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), axiom_1_4).
% 0.77/0.59 cnf(c_0_10, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.77/0.59 cnf(c_0_11, plain, (theorem(or(X1,X2))|~theorem(or(X2,X1))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
% 0.77/0.59 cnf(c_0_12, plain, (theorem(X1)|~axiom(X1)), c_0_10).
% 0.77/0.59 cnf(c_0_13, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), inference(fof_simplification,[status(thm)],[rule_3])).
% 0.77/0.59 cnf(c_0_14, plain, (theorem(or(X1,X2))|~axiom(or(X2,X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.77/0.59 cnf(c_0_15, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), c_0_13).
% 0.77/0.59 cnf(c_0_16, axiom, (axiom(or(not(X1),or(X2,X1)))), axiom_1_3).
% 0.77/0.59 cnf(c_0_17, plain, (theorem(or(or(X1,X2),not(or(X2,X1))))), inference(spm,[status(thm)],[c_0_14, c_0_9])).
% 0.77/0.59 cnf(c_0_18, axiom, (axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3))))), axiom_1_5).
% 0.77/0.59 cnf(c_0_19, plain, (theorem(or(not(X1),X2))|~theorem(or(not(or(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.77/0.59 cnf(c_0_20, plain, (theorem(or(not(or(X1,X2)),or(X2,X1)))), inference(spm,[status(thm)],[c_0_11, c_0_17])).
% 0.77/0.59 cnf(c_0_21, plain, (theorem(or(X1,or(X2,X3)))|~theorem(or(X2,or(X1,X3)))), inference(spm,[status(thm)],[c_0_8, c_0_18])).
% 0.77/0.59 cnf(c_0_22, plain, (theorem(or(not(X1),or(X1,X2)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
% 0.77/0.59 cnf(c_0_23, plain, (theorem(or(not(or(X1,X2)),X3))|~theorem(or(not(or(X2,X1)),X3))), inference(spm,[status(thm)],[c_0_15, c_0_9])).
% 0.77/0.59 cnf(c_0_24, plain, (theorem(or(X1,or(not(X1),X2)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.77/0.59 cnf(c_0_25, plain, (theorem(or(not(or(X1,X2)),or(not(not(or(X2,X1))),X3)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.77/0.59 cnf(c_0_26, negated_conjecture, (~theorem(or(not(not(or(p,q))),or(not(p),q)))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.77/0.59 cnf(c_0_27, plain, (theorem(or(not(X1),or(not(not(or(X1,X2))),X3)))), inference(spm,[status(thm)],[c_0_19, c_0_25])).
% 0.77/0.59 cnf(c_0_28, negated_conjecture, (~theorem(or(not(not(or(p,q))),or(not(p),q)))), c_0_26).
% 0.77/0.59 cnf(c_0_29, plain, (theorem(or(not(not(or(X1,X2))),or(not(X1),X3)))), inference(spm,[status(thm)],[c_0_21, c_0_27])).
% 0.77/0.59 cnf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])]), ['proof']).
% 0.77/0.59 % SZS output end Proof
% 0.77/0.59 % User time : 0.084 s
% 0.77/0.59 % System time : 0.016 s
% 0.77/0.59 % Total time : 0.100 s
% 0.77/0.59 % User time : 0.084 s
% 0.77/0.59 % System time : 0.021 s
% 0.77/0.59 % Total time : 0.105 s
% 0.77/0.59
%------------------------------------------------------------------------------