%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.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:11 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.51s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL013-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.09/0.35 % Computer : n013.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Fri Sep 4 13:59:20 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.23/0.47 start to proof:theBenchmark.p
% 0.23/0.51 % Version : CSI_E---1.1
% 0.23/0.51 % Problem : theBenchmark.p
% 0.23/0.51 % Proof found!
% 0.23/0.51 # SZS status Unsatisfiable
% 0.23/0.51 % SZS output start Proof
% 0.23/0.51 cnf(condensed_detachment, axiom, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', condensed_detachment)).
% 0.23/0.51 cnf(xgf, axiom, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', xgf)).
% 0.23/0.51 cnf(prove_um, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_um)).
% 0.23/0.51 cnf(c_0_3, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), inference(fof_simplification,[status(thm)],[condensed_detachment])).
% 0.23/0.51 cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 0.23/0.51 cnf(c_0_5, axiom, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2))))), xgf).
% 0.23/0.51 cnf(c_0_6, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X1)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.23/0.51 cnf(c_0_7, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))), inference(fof_simplification,[status(thm)],[prove_um])).
% 0.23/0.51 cnf(c_0_8, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,equivalent(X3,X1)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.23/0.51 cnf(c_0_9, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(b,equivalent(c,a))))), c_0_7).
% 0.23/0.51 cnf(c_0_10, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(X2,equivalent(X3,X1)))), inference(spm,[status(thm)],[c_0_8, c_0_5])).
% 0.23/0.51 cnf(c_0_11, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_5])]), ['proof']).
% 0.23/0.51 % SZS output end Proof
% 0.23/0.51 % User time : 0.001 s
% 0.23/0.51 % System time : 0.003 s
% 0.23/0.51 % Total time : 0.004 s
% 0.23/0.51 % User time : 0.002 s
% 0.23/0.51 % System time : 0.006 s
% 0.23/0.51 % Total time : 0.008 s
% 0.23/0.51
%------------------------------------------------------------------------------