%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL107-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:39:24 PM UTC 2026
% Result : Unsatisfiable 6.71s 4.61s
% Output : CNFRefutation 6.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 45 ( 20 unt; 0 nHn; 26 RR)
% Number of literals : 77 ( 0 equ; 41 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 171 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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) ).
cnf(lg_27_1690,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X7))),equivalent(X3,equivalent(equivalent(X2,X1),X7)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_27_1690) ).
cnf(prove_p_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p_1) ).
cnf(c_0_3,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X5),equivalent(equivalent(equivalent(X6,X5),equivalent(X6,X4)),X7))),equivalent(X3,equivalent(equivalent(X2,X1),X7)))),
lg_27_1690 ).
cnf(c_0_5,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),X1),equivalent(equivalent(X5,X6),equivalent(equivalent(equivalent(X7,X6),equivalent(X7,X5)),X4)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X4)),equivalent(equivalent(equivalent(X5,X6),equivalent(equivalent(X7,X5),equivalent(X7,X6))),X4))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(equivalent(X4,equivalent(equivalent(X5,X6),equivalent(X5,X7))),equivalent(X4,equivalent(X6,X7))),X8)),equivalent(equivalent(X2,X3),X8))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),equivalent(equivalent(equivalent(X5,equivalent(equivalent(X6,X7),equivalent(X6,X8))),equivalent(X5,equivalent(X7,X8))),X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(X3,X5)))),equivalent(X1,equivalent(X4,X5))),X6),X6)),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(equivalent(X3,equivalent(X4,X5)),equivalent(X3,equivalent(X4,X6)))),equivalent(X2,equivalent(X5,X6))),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X3,X5)))),equivalent(X1,equivalent(X2,X6))),equivalent(equivalent(X4,X5),X6))),
inference(spm,[status(thm)],[c_0_10,c_0_4]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X5,equivalent(equivalent(X6,X1),equivalent(X6,X2)))),equivalent(X4,equivalent(X5,X3)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),equivalent(equivalent(X1,equivalent(equivalent(X5,X2),equivalent(X5,X3))),X4))),
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),X5))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X3,X4)),X5)) ),
inference(spm,[status(thm)],[c_0_3,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X3,X5))))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X4,X5)),X1)) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,X5)),equivalent(equivalent(equivalent(X6,X3),equivalent(X6,X4)),X5)),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3)))
| ~ is_a_theorem(equivalent(X2,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X4,X2),X5))),equivalent(equivalent(X4,X3),X5))),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_21,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(e,b),equivalent(equivalent(a,e),c)))),
prove_p_1 ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2)) ),
inference(spm,[status(thm)],[c_0_3,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X5,X2)),equivalent(equivalent(X6,X4),equivalent(X6,equivalent(equivalent(X1,X5),X3))))) ),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(e,b),equivalent(equivalent(a,e),c))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,b),c),equivalent(equivalent(X1,equivalent(X2,b)),equivalent(X1,equivalent(equivalent(e,X2),equivalent(equivalent(a,e),c)))))),
inference(spm,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_28,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_25,c_0_19]) ).
cnf(c_0_29,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X2,equivalent(X3,X3)),X1))) ),
inference(spm,[status(thm)],[c_0_3,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,c),equivalent(X1,equivalent(equivalent(e,a),equivalent(equivalent(a,e),c))))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_3,c_0_22]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(e,a),equivalent(equivalent(a,e),c)))))
| ~ is_a_theorem(equivalent(equivalent(X2,c),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_34,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X3),X1)))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(e,a),equivalent(equivalent(a,e),c))))
| ~ is_a_theorem(equivalent(equivalent(X2,c),equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_33,c_0_19]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))))
| ~ is_a_theorem(equivalent(X1,equivalent(X3,X4))) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(e,X1),equivalent(equivalent(a,e),c)))
| ~ is_a_theorem(equivalent(equivalent(X2,c),equivalent(X2,equivalent(a,X1)))) ),
inference(spm,[status(thm)],[c_0_36,c_0_28]) ).
cnf(c_0_40,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X4)),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X3,X2),equivalent(X3,X1)),X4)),equivalent(equivalent(X5,X5),X4))),
inference(spm,[status(thm)],[c_0_5,c_0_32]) ).
cnf(c_0_42,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,c),equivalent(X1,equivalent(a,X2))))
| ~ is_a_theorem(equivalent(equivalent(a,X2),c)) ),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X3)),equivalent(X2,X1)))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : LCL107-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.06 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 21:59:01 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 6.71/4.61 % Version : CSE_E---1.7
% 6.71/4.61 % Problem : theBenchmark.p
% 6.71/4.61 % SZS status Unsatisfiable for theBenchmark.p
% 6.71/4.61 % SZS output start CNFRefutation
% See solution above
% 6.71/4.63 % Total time : 3.361s
%------------------------------------------------------------------------------