%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL171-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n013.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:26 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL171-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.33 % Computer : n013.cluster.edu
% 0.07/0.33 % Model : x86_64 x86_64
% 0.07/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33 % Memory : 8046.5625MB
% 0.07/0.33 % OS : Linux 6.8.0-71-generic
% 0.07/0.33 % CPULimit : 300
% 0.07/0.33 % WCLimit : 300
% 0.07/0.33 % DateTime : Sat Sep 5 03:38:50 UTC 2026
% 0.07/0.33 % CPUTime :
% 0.12/0.45 start to proof:theBenchmark.p
% 0.24/0.51 % Version : CSI_E---1.1
% 0.24/0.51 % Problem : theBenchmark.p
% 0.24/0.51 % Proof found!
% 0.24/0.51 # SZS status Unsatisfiable
% 0.24/0.51 % SZS output start Proof
% 0.24/0.51 cnf(prove_this, negated_conjecture, (~theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.24/0.51 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax', rule_1)).
% 0.24/0.51 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.51 cnf(c_0_3, negated_conjecture, (~theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.24/0.51 cnf(c_0_4, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.24/0.51 cnf(c_0_5, negated_conjecture, (~theorem(or(not(or(not(p),not(q))),or(not(q),not(p))))), c_0_3).
% 0.24/0.51 cnf(c_0_6, plain, (theorem(X1)|~axiom(X1)), c_0_4).
% 0.24/0.51 cnf(c_0_7, axiom, (axiom(or(not(or(X1,X2)),or(X2,X1)))), axiom_1_4).
% 0.24/0.51 cnf(c_0_8, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7])]), ['proof']).
% 0.24/0.51 % SZS output end Proof
% 0.24/0.51 % User time : 0.002 s
% 0.24/0.51 % System time : 0.002 s
% 0.24/0.51 % Total time : 0.004 s
% 0.24/0.51 % User time : 0.004 s
% 0.24/0.51 % System time : 0.005 s
% 0.24/0.51 % Total time : 0.009 s
% 0.24/0.51
%------------------------------------------------------------------------------