%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL128-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n001.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:23 AM UTC 2026
% Result : Unsatisfiable 0.27s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL128-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.35 % Computer : n001.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 : Sat Sep 5 12:22:01 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.14/0.47 start to proof:theBenchmark.p
% 0.27/0.55 % Version : CSI_E---1.1
% 0.27/0.55 % Problem : theBenchmark.p
% 0.27/0.55 % Proof found!
% 0.27/0.55 # SZS status Unsatisfiable
% 0.27/0.55 % SZS output start Proof
% 0.27/0.55 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.27/0.55 cnf(s_3, axiom, (is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', s_3)).
% 0.27/0.55 cnf(prove_lg_2, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_lg_2)).
% 0.27/0.55 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.27/0.55 cnf(c_0_4, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_3).
% 0.27/0.55 cnf(c_0_5, axiom, (is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)))))), s_3).
% 0.27/0.55 cnf(c_0_6, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.27/0.55 cnf(c_0_7, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)))|~is_a_theorem(X4)), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.27/0.55 cnf(c_0_8, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))|~is_a_theorem(X4)), inference(spm,[status(thm)],[c_0_4, c_0_7])).
% 0.27/0.55 cnf(c_0_9, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))), inference(spm,[status(thm)],[c_0_8, c_0_5])).
% 0.27/0.55 cnf(c_0_10, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))))|~is_a_theorem(equivalent(X1,equivalent(X2,X4)))), inference(spm,[status(thm)],[c_0_9, c_0_6])).
% 0.27/0.55 cnf(c_0_11, plain, (is_a_theorem(equivalent(X1,equivalent(X2,X3)))|~is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.27/0.55 cnf(c_0_12, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)))), inference(spm,[status(thm)],[c_0_7, c_0_5])).
% 0.27/0.55 cnf(c_0_13, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.27/0.55 cnf(c_0_14, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))|~is_a_theorem(equivalent(X4,equivalent(X1,X3)))|~is_a_theorem(X4)), inference(spm,[status(thm)],[c_0_4, c_0_10])).
% 0.27/0.55 cnf(c_0_15, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_9, c_0_13])).
% 0.27/0.55 cnf(c_0_16, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), inference(fof_simplification,[status(thm)],[prove_lg_2])).
% 0.27/0.55 cnf(c_0_17, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))|~is_a_theorem(equivalent(X1,X3))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.27/0.55 cnf(c_0_18, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))), c_0_16).
% 0.27/0.55 cnf(c_0_19, 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_4, c_0_17])).
% 0.27/0.55 cnf(c_0_20, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
% 0.27/0.55 cnf(c_0_21, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_20, c_0_17])).
% 0.27/0.55 cnf(c_0_22, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_19, c_0_15])).
% 0.27/0.55 cnf(c_0_23, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))))))|~is_a_theorem(equivalent(X1,a))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
% 0.27/0.55 cnf(c_0_24, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))),a))|~is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c))))), inference(spm,[status(thm)],[c_0_23, c_0_10])).
% 0.27/0.55 cnf(c_0_25, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e)))))|~is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,c))))), inference(spm,[status(thm)],[c_0_24, c_0_22])).
% 0.27/0.55 cnf(c_0_26, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(equivalent(X1,equivalent(c,e)),equivalent(b,c))))|~is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e))))), inference(spm,[status(thm)],[c_0_25, c_0_10])).
% 0.27/0.55 cnf(c_0_27, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X5)))|~is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X4),X5)))), inference(spm,[status(thm)],[c_0_11, c_0_6])).
% 0.27/0.55 cnf(c_0_28, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e))))|~is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c))))), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 0.27/0.55 cnf(c_0_29, negated_conjecture, (~is_a_theorem(equivalent(a,equivalent(X1,b)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_10]), c_0_10])).
% 0.27/0.55 cnf(c_0_30, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)),X5)),X5)))), inference(spm,[status(thm)],[c_0_11, c_0_5])).
% 0.27/0.55 cnf(c_0_31, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_29, c_0_30]), ['proof']).
% 0.27/0.55 % SZS output end Proof
% 0.27/0.55 % User time : 0.009 s
% 0.27/0.55 % System time : 0.004 s
% 0.27/0.55 % Total time : 0.013 s
% 0.27/0.55 % User time : 0.081 s
% 0.27/0.55 % System time : 0.018 s
% 0.27/0.55 % Total time : 0.100 s
% 0.27/0.55
%------------------------------------------------------------------------------