%------------------------------------------------------------------------------
% File : CSI_E---1.1
% Problem : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar mcs_scs.jar %d %s
% Computer : n006.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:19 AM UTC 2026
% Result : Unsatisfiable 0.24s 0.53s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : java -jar mcs_scs.jar %d %s
% 0.08/0.34 % Computer : n006.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sat Sep 5 18:48:01 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.24/0.46 start to proof:theBenchmark.p
% 0.24/0.53 % Version : CSI_E---1.1
% 0.24/0.53 % Problem : theBenchmark.p
% 0.24/0.53 % Proof found!
% 0.24/0.53 # SZS status Unsatisfiable
% 0.24/0.53 % SZS output start Proof
% 0.24/0.53 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.53 cnf(lg_3, axiom, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', lg_3)).
% 0.24/0.53 cnf(lg_2, axiom, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', lg_2)).
% 0.24/0.53 cnf(prove_lg_4, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove_lg_4)).
% 0.24/0.53 cnf(c_0_4, 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.53 cnf(c_0_5, plain, (is_a_theorem(X2)|~is_a_theorem(equivalent(X1,X2))|~is_a_theorem(X1)), c_0_4).
% 0.24/0.53 cnf(c_0_6, axiom, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5))), lg_3).
% 0.24/0.53 cnf(c_0_7, axiom, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4))), lg_2).
% 0.24/0.53 cnf(c_0_8, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),equivalent(equivalent(X3,X4),X5)),X1))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
% 0.24/0.53 cnf(c_0_9, plain, (is_a_theorem(X1)|~is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))), inference(spm,[status(thm)],[c_0_5, c_0_7])).
% 0.24/0.53 cnf(c_0_10, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2)))), inference(spm,[status(thm)],[c_0_8, c_0_7])).
% 0.24/0.53 cnf(c_0_11, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3))))), inference(spm,[status(thm)],[c_0_8, c_0_6])).
% 0.24/0.53 cnf(c_0_12, plain, (is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
% 0.24/0.53 cnf(c_0_13, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)))|~is_a_theorem(equivalent(equivalent(X3,X2),X4))), inference(spm,[status(thm)],[c_0_5, c_0_11])).
% 0.24/0.53 cnf(c_0_14, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), inference(fof_simplification,[status(thm)],[prove_lg_4])).
% 0.24/0.53 cnf(c_0_15, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2)))), inference(spm,[status(thm)],[c_0_5, c_0_12])).
% 0.24/0.53 cnf(c_0_16, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(equivalent(X1,X4),X3))|~is_a_theorem(equivalent(X2,X4))), inference(spm,[status(thm)],[c_0_5, c_0_13])).
% 0.24/0.53 cnf(c_0_17, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), c_0_14).
% 0.24/0.53 cnf(c_0_18, plain, (is_a_theorem(equivalent(X1,X2))|~is_a_theorem(equivalent(equivalent(X3,X4),equivalent(X3,X2)))|~is_a_theorem(equivalent(X1,X4))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
% 0.24/0.53 cnf(c_0_19, plain, (is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1)))), inference(spm,[status(thm)],[c_0_15, c_0_11])).
% 0.24/0.53 cnf(c_0_20, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))|~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),X2))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
% 0.24/0.53 cnf(c_0_21, plain, (is_a_theorem(equivalent(X1,X1))), inference(spm,[status(thm)],[c_0_15, c_0_10])).
% 0.24/0.53 cnf(c_0_22, plain, (is_a_theorem(equivalent(equivalent(X1,X1),X2))|~is_a_theorem(X2)), inference(spm,[status(thm)],[c_0_5, c_0_19])).
% 0.24/0.53 cnf(c_0_23, negated_conjecture, (~is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(a,b),c),e)),equivalent(X1,equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
% 0.24/0.53 cnf(c_0_24, plain, (is_a_theorem(equivalent(equivalent(X1,X2),X3))|~is_a_theorem(equivalent(X2,X1))|~is_a_theorem(X3)), inference(spm,[status(thm)],[c_0_16, c_0_22])).
% 0.24/0.53 cnf(c_0_25, negated_conjecture, (~is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))|~is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),X1))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
% 0.24/0.53 cnf(c_0_26, negated_conjecture, (~is_a_theorem(equivalent(equivalent(equivalent(X1,c),equivalent(equivalent(equivalent(a,b),X1),e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))), inference(spm,[status(thm)],[c_0_25, c_0_11])).
% 0.24/0.53 cnf(c_0_27, plain, (is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))|~is_a_theorem(equivalent(X2,X3))), inference(spm,[status(thm)],[c_0_16, c_0_21])).
% 0.24/0.53 cnf(c_0_28, plain, (is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)))), inference(spm,[status(thm)],[c_0_8, c_0_21])).
% 0.24/0.53 cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])]), ['proof']).
% 0.24/0.53 % SZS output end Proof
% 0.24/0.53 % User time : 0.022 s
% 0.24/0.53 % System time : 0.002 s
% 0.24/0.53 % Total time : 0.024 s
% 0.24/0.53 % User time : 0.022 s
% 0.24/0.53 % System time : 0.006 s
% 0.24/0.53 % Total time : 0.029 s
% 0.24/0.53
%------------------------------------------------------------------------------