%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL010-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n020.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:11 AM UTC 2026
% Result : Unsatisfiable 0.23s 0.55s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL010-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 : n020.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 12:40:57 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.23/0.48 start to proof:theBenchmark.p
% 0.23/0.55 % Version : CSI_E---1.1
% 0.23/0.55 % Problem : theBenchmark.p
% 0.23/0.55 % Proof found!
% 0.23/0.55 # SZS status Unsatisfiable
% 0.23/0.55 % SZS output start Proof
% 0.23/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.23/0.55 cnf(yqf, axiom, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X3,X2))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', yqf)).
% 0.23/0.55 cnf(prove_yql, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_yql)).
% 0.23/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.23/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.23/0.55 cnf(c_0_5, axiom, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X3,X2))))), yqf).
% 0.23/0.55 cnf(c_0_6, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X3)))|~is_a_theorem(equivalent(X1,X3))), inference(spm,[status(thm)],[c_0_4, c_0_5])).
% 0.23/0.55 cnf(c_0_7, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X3,X1))|~is_a_theorem(equivalent(X3,X2))), inference(spm,[status(thm)],[c_0_4, c_0_6])).
% 0.23/0.55 cnf(c_0_8, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),X4))|~is_a_theorem(equivalent(equivalent(X1,X3),X4))), inference(spm,[status(thm)],[c_0_7, c_0_5])).
% 0.23/0.55 cnf(c_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X3,X4)))|~is_a_theorem(equivalent(equivalent(X2,X4),X1))), inference(spm,[status(thm)],[c_0_4, c_0_8])).
% 0.23/0.55 cnf(c_0_10, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,equivalent(X3,equivalent(X2,X3))),X1))), inference(spm,[status(thm)],[c_0_9, c_0_5])).
% 0.23/0.55 cnf(c_0_11, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X2,X3),X3)),X1))), inference(spm,[status(thm)],[c_0_10, c_0_8])).
% 0.23/0.55 cnf(c_0_12, plain, (is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X3))|~is_a_theorem(equivalent(X2,X3))), inference(spm,[status(thm)],[c_0_10, c_0_6])).
% 0.23/0.55 cnf(c_0_13, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(X2,X2),X1))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
% 0.23/0.55 cnf(c_0_14, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1)))), inference(spm,[status(thm)],[c_0_13, c_0_5])).
% 0.23/0.55 cnf(c_0_15, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(X2,X1))), inference(spm,[status(thm)],[c_0_4, c_0_14])).
% 0.23/0.55 cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(equivalent(X2,X1),X3))), inference(spm,[status(thm)],[c_0_7, c_0_14])).
% 0.23/0.55 cnf(c_0_17, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X2,X3)),equivalent(X1,X3)))), inference(spm,[status(thm)],[c_0_15, c_0_5])).
% 0.23/0.55 cnf(c_0_18, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c))))), inference(fof_simplification,[status(thm)],[prove_yql])).
% 0.23/0.55 cnf(c_0_19, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),equivalent(X3,X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
% 0.23/0.55 cnf(c_0_20, negated_conjecture, (~is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(a,c))))), c_0_18).
% 0.23/0.55 cnf(c_0_21, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X1,X3))))), inference(spm,[status(thm)],[c_0_15, c_0_19])).
% 0.23/0.55 cnf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21])]), ['proof']).
% 0.23/0.55 % SZS output end Proof
% 0.23/0.55 % User time : 0.022 s
% 0.23/0.55 % System time : 0.002 s
% 0.23/0.55 % Total time : 0.023 s
% 0.23/0.55 % User time : 0.023 s
% 0.23/0.55 % System time : 0.005 s
% 0.23/0.55 % Total time : 0.028 s
% 0.23/0.55
%------------------------------------------------------------------------------