%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL120-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n014.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:22 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 : LCL120-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.36 % Computer : n014.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 20:42:12 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.24/0.48 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(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.24/0.54 cnf(qyf, axiom, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X3,X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', qyf)).
% 0.24/0.54 cnf(prove_xgj, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_xgj)).
% 0.24/0.54 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.24/0.54 cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 0.24/0.54 cnf(c_0_5, axiom, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X3,X2)))), qyf).
% 0.24/0.54 cnf(c_0_6, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,X2),equivalent(X3,X1)))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.24/0.54 cnf(c_0_7, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1))))), inference(spm,[status(thm)],[c_0_6, c_0_5])).
% 0.24/0.54 cnf(c_0_8, plain, (is_a_theorem(equivalent(X1,equivalent(X1,X2)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_7])).
% 0.24/0.54 cnf(c_0_9, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2))), inference(spm,[status(thm)],[c_0_6, c_0_7])).
% 0.24/0.54 cnf(c_0_10, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_8])).
% 0.24/0.54 cnf(c_0_11, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X2,X1)))), inference(spm,[status(thm)],[c_0_4, c_0_9])).
% 0.24/0.54 cnf(c_0_12, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X3,X2))|~is_a_theorem(equivalent(X3,X1))), inference(spm,[status(thm)],[c_0_6, c_0_10])).
% 0.24/0.54 cnf(c_0_13, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_11, c_0_7])).
% 0.24/0.54 cnf(c_0_14, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.24/0.54 cnf(c_0_15, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,equivalent(X3,X2)),X1))), inference(spm,[status(thm)],[c_0_12, c_0_9])).
% 0.24/0.54 cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X3,X1))))), inference(spm,[status(thm)],[c_0_14, c_0_5])).
% 0.24/0.54 cnf(c_0_17, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c))))), inference(fof_simplification,[status(thm)],[prove_xgj])).
% 0.24/0.54 cnf(c_0_18, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,X2)),X3))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.24/0.54 cnf(c_0_19, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(c,a)),equivalent(b,c))))), c_0_17).
% 0.24/0.54 cnf(c_0_20, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X2,X3))))), inference(spm,[status(thm)],[c_0_14, c_0_18])).
% 0.24/0.54 cnf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])]), ['proof']).
% 0.24/0.54 % SZS output end Proof
% 0.24/0.54 % User time : 0.004 s
% 0.24/0.54 % System time : 0.003 s
% 0.24/0.54 % Total time : 0.007 s
% 0.24/0.54 % User time : 0.005 s
% 0.24/0.54 % System time : 0.006 s
% 0.24/0.54 % Total time : 0.011 s
% 0.24/0.54
%------------------------------------------------------------------------------