%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n010.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:28 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL186-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.36 % Computer : n010.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 4 23:44:23 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.24/0.49 start to proof:theBenchmark.p
% 0.24/0.55 % Version : CSI_E---1.1
% 0.24/0.55 % Problem : theBenchmark.p
% 0.24/0.55 % Proof found!
% 0.24/0.55 # SZS status Unsatisfiable
% 0.24/0.55 % SZS output start Proof
% 0.24/0.55 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.24/0.55 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_1)).
% 0.24/0.55 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.24/0.55 cnf(prove_this, negated_conjecture, (~theorem(or(not(not(p)),or(not(p),q)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.24/0.55 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.24/0.55 cnf(c_0_5, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), inference(fof_simplification,[status(thm)],[rule_3])).
% 0.24/0.55 cnf(c_0_6, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.24/0.55 cnf(c_0_7, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~theorem(or(not(X3),X2))), c_0_5).
% 0.24/0.55 cnf(c_0_8, plain, (theorem(X1)|~axiom(X1)), c_0_6).
% 0.24/0.55 cnf(c_0_9, plain, (theorem(or(not(X1),X2))|~axiom(or(not(X1),X3))|~axiom(or(not(X3),X2))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.24/0.55 cnf(c_0_10, axiom, (axiom(or(not(X1),or(X2,X1)))), axiom_1_3).
% 0.24/0.55 cnf(c_0_11, negated_conjecture, (~theorem(or(not(not(p)),or(not(p),q)))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.24/0.55 cnf(c_0_12, plain, (theorem(or(not(X1),X2))|~axiom(or(not(or(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.24/0.55 cnf(c_0_13, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), axiom_1_4).
% 0.24/0.55 cnf(c_0_14, negated_conjecture, (~theorem(or(not(not(p)),or(not(p),q)))), c_0_11).
% 0.24/0.55 cnf(c_0_15, plain, (theorem(or(not(X1),or(X1,X2)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.24/0.55 cnf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14, c_0_15])]), ['proof']).
% 0.24/0.56 % SZS output end Proof
% 0.24/0.56 % User time : 0.005 s
% 0.24/0.56 % System time : 0.003 s
% 0.24/0.56 % Total time : 0.008 s
% 0.24/0.56 % User time : 0.021 s
% 0.24/0.56 % System time : 0.009 s
% 0.24/0.56 % Total time : 0.030 s
% 0.24/0.56
%------------------------------------------------------------------------------