%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL171-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n027.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.54s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL171-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.35 % Computer : n027.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 22:15:57 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.24/0.47 start to proof:theBenchmark.p
% 0.24/0.54 % Version : CSI_E---1.1
% 0.24/0.54 % Problem : theBenchmark.p
% 0.24/0.54 % Proof found!
% 0.24/0.54 # SZS status Unsatisfiable
% 0.24/0.54 % SZS output start Proof
% 0.24/0.54 cnf(rule_1, axiom, (theorem(X1)|~axiom(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', rule_1)).
% 0.24/0.54 cnf(axiom_1_4, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', axiom_1_4)).
% 0.24/0.54 cnf(implies_definition, axiom, (implies(X1,X2)=or(not(X1),X2)), file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax', implies_definition)).
% 0.24/0.54 cnf(prove_this, negated_conjecture, (~theorem(implies(implies(p,not(q)),implies(q,not(p))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_this)).
% 0.24/0.54 cnf(c_0_4, plain, (theorem(X1)|~axiom(X1)), inference(fof_simplification,[status(thm)],[rule_1])).
% 0.24/0.54 cnf(c_0_5, plain, (theorem(X1)|~axiom(X1)), c_0_4).
% 0.24/0.54 cnf(c_0_6, axiom, (axiom(implies(or(X1,X2),or(X2,X1)))), axiom_1_4).
% 0.24/0.54 cnf(c_0_7, plain, (theorem(implies(or(X1,X2),or(X2,X1)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.24/0.54 cnf(c_0_8, axiom, (implies(X1,X2)=or(not(X1),X2)), implies_definition).
% 0.24/0.54 cnf(c_0_9, negated_conjecture, (~theorem(implies(implies(p,not(q)),implies(q,not(p))))), inference(fof_simplification,[status(thm)],[prove_this])).
% 0.24/0.54 cnf(c_0_10, plain, (theorem(implies(or(X1,not(X2)),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_7, c_0_8])).
% 0.24/0.54 cnf(c_0_11, negated_conjecture, (~theorem(implies(implies(p,not(q)),implies(q,not(p))))), c_0_9).
% 0.24/0.54 cnf(c_0_12, plain, (theorem(implies(implies(X1,not(X2)),implies(X2,not(X1))))), inference(spm,[status(thm)],[c_0_10, c_0_8])).
% 0.24/0.54 cnf(c_0_13, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11, c_0_12])]), ['proof']).
% 0.24/0.54 % SZS output end Proof
% 0.24/0.54 % User time : 0.006 s
% 0.24/0.54 % System time : 0.001 s
% 0.24/0.54 % Total time : 0.007 s
% 0.24/0.54 % User time : 0.008 s
% 0.24/0.54 % System time : 0.004 s
% 0.24/0.54 % Total time : 0.012 s
% 0.24/0.54
%------------------------------------------------------------------------------