%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL131-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 : n004.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:29 PM UTC 2026
% Result : Unsatisfiable 2.39s 2.05s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 19 unt; 0 nHn; 12 RR)
% Number of literals : 42 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 84 ( 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(s_6,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_6) ).
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/sandbox2/benchmark/theBenchmark.p',prove_lg_2) ).
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(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1)),
s_6 ).
cnf(c_0_5,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3)),equivalent(equivalent(equivalent(X4,X5),equivalent(X6,X5)),equivalent(X4,X6)))),
inference(spm,[status(thm)],[c_0_5,c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_3,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(equivalent(X1,X4),equivalent(X3,X4)))),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4),equivalent(equivalent(X1,X3),X4))),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),X3))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X4),equivalent(X2,X4)),X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2)))
| ~ is_a_theorem(equivalent(X1,X3)) ),
inference(spm,[status(thm)],[c_0_3,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))),equivalent(X1,equivalent(X2,X4)))),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_17,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_3,c_0_15]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(X2,X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_24,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X4,X3)),X1)) ),
inference(spm,[status(thm)],[c_0_17,c_0_23]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))),X1)),
inference(spm,[status(thm)],[c_0_24,c_0_4]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
prove_lg_2 ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL131-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.12 % 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.15/0.33 % Computer : n004.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 22:03:17 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 2.39/2.05 % Version : CSE_E---1.7
% 2.39/2.05 % Problem : theBenchmark.p
% 2.39/2.05 % SZS status Unsatisfiable for theBenchmark.p
% 2.39/2.05 % SZS output start CNFRefutation
% See solution above
% 2.39/2.06 % Total time : 1.366s
%------------------------------------------------------------------------------