%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL096-1 : TPTP v9.2.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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:23 PM UTC 2026
% Result : Unsatisfiable 56.88s 33.40s
% Output : CNFRefutation 57.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 17 unt; 0 nHn; 19 RR)
% Number of literals : 56 ( 0 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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) ).
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) ).
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) ).
cnf(lg_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_4) ).
cnf(prove_lg_1,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_1) ).
cnf(c_0_5,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
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 ).
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 ).
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]) ).
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]) ).
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]) ).
cnf(c_0_11,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]) ).
cnf(c_0_12,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))),
lg_4 ).
cnf(c_0_13,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_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),X5)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X4),X3),X5)) ),
inference(spm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(equivalent(X1,X2))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X2),X1),X4)) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,plain,
( is_a_theorem(equivalent(equivalent(X1,X1),X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_19,plain,
( is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,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_5,c_0_19]) ).
cnf(c_0_21,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_13,c_0_20]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)),
prove_lg_1 ).
cnf(c_0_23,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X5,X2),X6),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X5),X3),X6)) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,b),a)),X2),c))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,X1),c),X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(b,b),a)),equivalent(equivalent(X2,X2),equivalent(equivalent(a,X1),c))),c)),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_26,plain,
( is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_27,plain,
( is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X4))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X5),X1),equivalent(X5,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),c)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_30,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),X2))
| ~ is_a_theorem(equivalent(X2,c)) ),
inference(spm,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_13,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,b),a),equivalent(equivalent(a,equivalent(X1,X1)),c)),equivalent(equivalent(X2,X2),c))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_32,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : LCL096-1 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.06 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.24 % Computer : n024.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 16:59:26 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 56.88/33.40 % Version : CSE_E---1.7
% 56.88/33.40 % Problem : theBenchmark.p
% 56.88/33.40 % SZS status Unsatisfiable for theBenchmark.p
% 56.88/33.40 % SZS output start CNFRefutation
% See solution above
% 57.08/33.62 % Total time : 24.384s
%------------------------------------------------------------------------------