%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL019-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n031.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 3.26s 0.99s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL019-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.11/0.36 % Computer : n031.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 4 15:27:54 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.23/0.49 start to proof:theBenchmark.p
% 3.26/0.99 % Version : CSI_E---1.1
% 3.26/0.99 % Problem : theBenchmark.p
% 3.26/0.99 % Proof found!
% 3.26/0.99 # SZS status Unsatisfiable
% 3.26/0.99 % SZS output start Proof
% 3.26/0.99 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)).
% 3.26/0.99 cnf(xgk, axiom, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', xgk)).
% 3.26/0.99 cnf(prove_pym, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_pym)).
% 3.26/0.99 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])).
% 3.26/0.99 cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 3.26/0.99 cnf(c_0_5, axiom, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2))))), xgk).
% 3.26/0.99 cnf(c_0_6, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 3.26/0.99 cnf(c_0_7, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,equivalent(X1,X3)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 3.26/0.99 cnf(c_0_8, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_7, c_0_5])).
% 3.26/0.99 cnf(c_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X3,X1)))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_4, c_0_8])).
% 3.26/0.99 cnf(c_0_10, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X2,X3))))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_9, c_0_6])).
% 3.26/0.99 cnf(c_0_11, plain, (is_a_theorem(equivalent(X1,equivalent(X2,X2)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_10, c_0_5])).
% 3.26/0.99 cnf(c_0_12, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X3)),X3))), inference(spm,[status(thm)],[c_0_9, c_0_5])).
% 3.26/0.99 cnf(c_0_13, plain, (is_a_theorem(equivalent(X1,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_11])).
% 3.26/0.99 cnf(c_0_14, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,X3))))), inference(spm,[status(thm)],[c_0_12, c_0_11])).
% 3.26/0.99 cnf(c_0_15, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_13, c_0_5])).
% 3.26/0.99 cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2))), inference(spm,[status(thm)],[c_0_14, c_0_5])).
% 3.26/0.99 cnf(c_0_17, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_9, c_0_11])).
% 3.26/0.99 cnf(c_0_18, plain, (is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2))))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 3.26/0.99 cnf(c_0_19, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(X3,X3))))))), inference(spm,[status(thm)],[c_0_14, c_0_16])).
% 3.26/0.99 cnf(c_0_20, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,equivalent(X2,X2)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 3.26/0.99 cnf(c_0_21, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3))))), inference(spm,[status(thm)],[c_0_7, c_0_19])).
% 3.26/0.99 cnf(c_0_22, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3))))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_20, c_0_8])).
% 3.26/0.99 cnf(c_0_23, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 3.26/0.99 cnf(c_0_24, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),X3))), inference(spm,[status(thm)],[c_0_23, c_0_5])).
% 3.26/0.99 cnf(c_0_25, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2))))), inference(spm,[status(thm)],[c_0_12, c_0_24])).
% 3.26/0.99 cnf(c_0_26, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X2))), inference(spm,[status(thm)],[c_0_23, c_0_25])).
% 3.26/0.99 cnf(c_0_27, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X1,equivalent(X3,X3)),X2))))), inference(spm,[status(thm)],[c_0_14, c_0_26])).
% 3.26/0.99 cnf(c_0_28, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1))))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_23, c_0_8])).
% 3.26/0.99 cnf(c_0_29, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))), inference(spm,[status(thm)],[c_0_17, c_0_5])).
% 3.26/0.99 cnf(c_0_30, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X3))|~is_a_theorem(equivalent(X3,X1))), inference(spm,[status(thm)],[c_0_9, c_0_27])).
% 3.26/0.99 cnf(c_0_31, 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_7, c_0_28])).
% 3.26/0.99 cnf(c_0_32, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X1,X2),X2))), inference(spm,[status(thm)],[c_0_29, c_0_30])).
% 3.26/0.99 cnf(c_0_33, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X2))))|~is_a_theorem(equivalent(X3,X1))), inference(spm,[status(thm)],[c_0_31, c_0_25])).
% 3.26/0.99 cnf(c_0_34, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,equivalent(X2,X3)))))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
% 3.26/0.99 cnf(c_0_35, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1)))), inference(spm,[status(thm)],[c_0_34, c_0_5])).
% 3.26/0.99 cnf(c_0_36, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,equivalent(X2,X3)),X1))), inference(spm,[status(thm)],[c_0_31, c_0_26])).
% 3.26/0.99 cnf(c_0_37, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,X1))))), inference(spm,[status(thm)],[c_0_21, c_0_5])).
% 3.26/0.99 cnf(c_0_38, plain, (is_a_theorem(equivalent(X1,equivalent(X2,X3)))|~is_a_theorem(equivalent(equivalent(X3,X2),X1))), inference(spm,[status(thm)],[c_0_31, c_0_35])).
% 3.26/0.99 cnf(c_0_39, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X1,equivalent(X2,equivalent(X3,X2)))),X3))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
% 3.26/0.99 cnf(c_0_40, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,equivalent(X2,X1)))))), inference(spm,[status(thm)],[c_0_38, c_0_24])).
% 3.26/0.99 cnf(c_0_41, plain, (is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X3,equivalent(X1,X3))))))), inference(spm,[status(thm)],[c_0_23, c_0_39])).
% 3.26/0.99 cnf(c_0_42, plain, (is_a_theorem(equivalent(X1,equivalent(X2,X3)))|~is_a_theorem(equivalent(equivalent(X2,X1),X3))), inference(spm,[status(thm)],[c_0_9, c_0_40])).
% 3.26/0.99 cnf(c_0_43, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,equivalent(X1,X3))),X3))), inference(spm,[status(thm)],[c_0_23, c_0_40])).
% 3.26/0.99 cnf(c_0_44, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X1,equivalent(X3,equivalent(X2,X3))))), inference(spm,[status(thm)],[c_0_7, c_0_41])).
% 3.26/0.99 cnf(c_0_45, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X2,X1),X3)))), inference(spm,[status(thm)],[c_0_42, c_0_43])).
% 3.26/0.99 cnf(c_0_46, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,equivalent(X2,X1)))),X3))), inference(spm,[status(thm)],[c_0_44, c_0_45])).
% 3.26/0.99 cnf(c_0_47, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X1,X3))),equivalent(X3,X2)))), inference(spm,[status(thm)],[c_0_42, c_0_46])).
% 3.26/0.99 cnf(c_0_48, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a)))), inference(fof_simplification,[status(thm)],[prove_pym])).
% 3.26/0.99 cnf(c_0_49, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X3,X1)),X3)))), inference(spm,[status(thm)],[c_0_38, c_0_47])).
% 3.26/0.99 cnf(c_0_50, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),b),equivalent(c,a)))), c_0_48).
% 3.26/0.99 cnf(c_0_51, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X3,X1)))), inference(spm,[status(thm)],[c_0_23, c_0_49])).
% 3.26/0.99 cnf(c_0_52, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50, c_0_51])]), ['proof']).
% 3.26/0.99 % SZS output end Proof
% 3.26/0.99 % User time : 0.456 s
% 3.26/0.99 % System time : 0.021 s
% 3.26/0.99 % Total time : 0.477 s
% 3.26/0.99 % User time : 0.456 s
% 3.26/0.99 % System time : 0.026 s
% 3.26/0.99 % Total time : 0.481 s
% 3.26/0.99
%------------------------------------------------------------------------------