%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n010.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:56 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.02 % Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02 % Command : java -jar mcs_scs.jar %d %s
% 0.07/0.34 % Computer : n010.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % 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:12:08 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.24/0.47 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/sandbox/benchmark/theBenchmark.p', condensed_detachment)).
% 0.24/0.54 cnf(xcb, axiom, (is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', xcb)).
% 0.24/0.54 cnf(prove_reflexivity, negated_conjecture, (~is_a_theorem(equivalent(a,a))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_reflexivity)).
% 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(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)))), xcb).
% 0.24/0.54 cnf(c_0_6, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.24/0.54 cnf(c_0_7, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X1,X3)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.24/0.54 cnf(c_0_8, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,X3)))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_7, c_0_5])).
% 0.24/0.54 cnf(c_0_9, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,X1),X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_4, c_0_8])).
% 0.24/0.54 cnf(c_0_10, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X1),X3),equivalent(X4,X3)),X4)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_9, c_0_5])).
% 0.24/0.54 cnf(c_0_11, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),equivalent(X3,X4)))|~is_a_theorem(X2)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_7, c_0_10])).
% 0.24/0.54 cnf(c_0_12, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X3,X1)))|~is_a_theorem(X3)|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_7, c_0_11])).
% 0.24/0.54 cnf(c_0_13, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X3),X1))|~is_a_theorem(X3)|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_12, c_0_8])).
% 0.24/0.54 cnf(c_0_14, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X3,X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_13, c_0_6])).
% 0.24/0.54 cnf(c_0_15, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_14, c_0_5])).
% 0.24/0.54 cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X1))|~is_a_theorem(equivalent(X3,X2))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_9, c_0_6])).
% 0.24/0.54 cnf(c_0_17, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X2)|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_15, c_0_10])).
% 0.24/0.54 cnf(c_0_18, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X1))|~is_a_theorem(X3)|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.24/0.54 cnf(c_0_19, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_18, c_0_5])).
% 0.24/0.54 cnf(c_0_20, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_4, c_0_19])).
% 0.24/0.54 cnf(c_0_21, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(X2,X3))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_20, c_0_8])).
% 0.24/0.54 cnf(c_0_22, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))), inference(spm,[status(thm)],[c_0_20, c_0_5])).
% 0.24/0.54 cnf(c_0_23, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X2,equivalent(X1,X2)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_7, c_0_21])).
% 0.24/0.54 cnf(c_0_24, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X3),X2))|~is_a_theorem(equivalent(X1,X3))), inference(spm,[status(thm)],[c_0_22, c_0_21])).
% 0.24/0.54 cnf(c_0_25, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_23, c_0_5])).
% 0.24/0.54 cnf(c_0_26, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X3)))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_24, c_0_6])).
% 0.24/0.54 cnf(c_0_27, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))), inference(spm,[status(thm)],[c_0_25, c_0_5])).
% 0.24/0.54 cnf(c_0_28, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X2))|~is_a_theorem(X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
% 0.24/0.54 cnf(c_0_29, negated_conjecture, (~is_a_theorem(equivalent(a,a))), inference(fof_simplification,[status(thm)],[prove_reflexivity])).
% 0.24/0.54 cnf(c_0_30, plain, (is_a_theorem(equivalent(X1,X1))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_9, c_0_28])).
% 0.24/0.54 cnf(c_0_31, negated_conjecture, (~is_a_theorem(equivalent(a,a))), c_0_29).
% 0.24/0.54 cnf(c_0_32, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_30, c_0_27])).
% 0.24/0.54 cnf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_32])]), ['proof']).
% 0.24/0.54 % SZS output end Proof
% 0.24/0.54 % User time : 0.024 s
% 0.24/0.54 % System time : 0.003 s
% 0.24/0.54 % Total time : 0.027 s
% 0.24/0.54 % User time : 0.026 s
% 0.24/0.54 % System time : 0.006 s
% 0.24/0.54 % Total time : 0.032 s
% 0.24/0.54
%------------------------------------------------------------------------------