%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL015-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n019.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:12 AM UTC 2026
% Result : Unsatisfiable 0.64s 0.59s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 5 17:53:23 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.24/0.48 start to proof:theBenchmark.p
% 0.64/0.59 % Version : CSI_E---1.1
% 0.64/0.59 % Problem : theBenchmark.p
% 0.64/0.59 % Proof found!
% 0.64/0.59 # SZS status Unsatisfiable
% 0.64/0.59 % SZS output start Proof
% 0.64/0.59 cnf(condensed_detachment, axiom, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', condensed_detachment)).
% 0.64/0.59 cnf(yrm, axiom, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X2,X3),X1))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', yrm)).
% 0.64/0.59 cnf(prove_wn, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_wn)).
% 0.64/0.59 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.64/0.59 cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 0.64/0.59 cnf(c_0_5, axiom, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(equivalent(X2,X3),X1))))), yrm).
% 0.64/0.59 cnf(c_0_6, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X1),X3)))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.64/0.59 cnf(c_0_7, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(X3,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.64/0.59 cnf(c_0_8, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,X3))|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_4, c_0_7])).
% 0.64/0.59 cnf(c_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X2),X4)))|~is_a_theorem(equivalent(X1,equivalent(X4,X3)))), inference(spm,[status(thm)],[c_0_8, c_0_5])).
% 0.64/0.59 cnf(c_0_10, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,equivalent(X2,X3)))|~is_a_theorem(equivalent(X2,X3))), inference(spm,[status(thm)],[c_0_9, c_0_6])).
% 0.64/0.59 cnf(c_0_11, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X1),X3))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_10, c_0_6])).
% 0.64/0.59 cnf(c_0_12, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X1,X2),X3)),X3))), inference(spm,[status(thm)],[c_0_11, c_0_5])).
% 0.64/0.59 cnf(c_0_13, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X3,equivalent(equivalent(X2,X3),X1)))), inference(spm,[status(thm)],[c_0_10, c_0_5])).
% 0.64/0.59 cnf(c_0_14, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_12, c_0_7])).
% 0.64/0.59 cnf(c_0_15, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),X3),X2))), inference(spm,[status(thm)],[c_0_13, c_0_5])).
% 0.64/0.59 cnf(c_0_16, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1))))|~is_a_theorem(equivalent(X2,X3))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.64/0.59 cnf(c_0_17, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X2,equivalent(X1,X3)))))), inference(spm,[status(thm)],[c_0_11, c_0_15])).
% 0.64/0.59 cnf(c_0_18, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(equivalent(X3,X2),X1))), inference(spm,[status(thm)],[c_0_13, c_0_16])).
% 0.64/0.59 cnf(c_0_19, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X1,X2)))), inference(spm,[status(thm)],[c_0_17, c_0_16])).
% 0.64/0.59 cnf(c_0_20, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X1,equivalent(X2,X3)))))), inference(spm,[status(thm)],[c_0_18, c_0_15])).
% 0.64/0.59 cnf(c_0_21, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_19, c_0_6])).
% 0.64/0.59 cnf(c_0_22, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,X2)))),X3))), inference(spm,[status(thm)],[c_0_13, c_0_20])).
% 0.64/0.59 cnf(c_0_23, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X1,equivalent(X2,X3))))))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.64/0.59 cnf(c_0_24, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X2),X1))),X3))), inference(spm,[status(thm)],[c_0_13, c_0_23])).
% 0.64/0.59 cnf(c_0_25, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(equivalent(X1,X3),X2)))))), inference(spm,[status(thm)],[c_0_21, c_0_24])).
% 0.64/0.59 cnf(c_0_26, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),equivalent(X3,X2))),X3))), inference(spm,[status(thm)],[c_0_13, c_0_25])).
% 0.64/0.59 cnf(c_0_27, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X2),equivalent(X1,X3)))))), inference(spm,[status(thm)],[c_0_21, c_0_26])).
% 0.64/0.59 cnf(c_0_28, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b))))), inference(fof_simplification,[status(thm)],[prove_wn])).
% 0.64/0.59 cnf(c_0_29, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X1)),X2))), inference(spm,[status(thm)],[c_0_13, c_0_27])).
% 0.64/0.59 cnf(c_0_30, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,equivalent(b,c)),equivalent(c,equivalent(a,b))))), c_0_28).
% 0.64/0.59 cnf(c_0_31, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X1,X2))))), inference(spm,[status(thm)],[c_0_18, c_0_29])).
% 0.64/0.59 cnf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_31])]), ['proof']).
% 0.64/0.59 % SZS output end Proof
% 0.64/0.59 % User time : 0.037 s
% 0.64/0.59 % System time : 0.002 s
% 0.64/0.59 % Total time : 0.039 s
% 0.64/0.59 % User time : 0.038 s
% 0.64/0.59 % System time : 0.005 s
% 0.64/0.59 % Total time : 0.043 s
% 0.64/0.59
%------------------------------------------------------------------------------