%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LCL982+1 : TPTP v9.2.1. Released v9.1.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 : n008.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:45:26 PM UTC 2026
% Result : Theorem 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 9 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 19 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 10 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(condensed_detachment,axiom,
! [X1,X2] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
fof(a5,axiom,
! [X3,X4,X5,X6,X7] : is_a_theorem(implies(implies(X3,X4),implies(implies(implies(X5,implies(X6,X7)),implies(X4,implies(not(X6),not(X3)))),implies(X3,X6)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a5) ).
fof(prove_cn_1,conjecture,
! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_1) ).
fof(c_0_3,plain,
! [X1,X2] :
( ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1)
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
fof(c_0_4,plain,
! [X18,X19] :
( ~ is_a_theorem(implies(X18,X19))
| ~ is_a_theorem(X18)
| is_a_theorem(X19) ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
fof(c_0_5,plain,
! [X20,X21,X22,X23,X24] : is_a_theorem(implies(implies(X20,X21),implies(implies(implies(X22,implies(X23,X24)),implies(X21,implies(not(X23),not(X20)))),implies(X20,X23)))),
inference(variable_rename,[status(thm)],[a5]) ).
cnf(c_0_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,implies(X4,X5)),implies(X2,implies(not(X4),not(X1)))),implies(X1,X4)))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,implies(not(X2),not(X5)))),implies(X5,X2)))
| ~ is_a_theorem(implies(X5,X4)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,implies(X2,X4)),implies(X5,implies(not(X2),not(X1)))))
| ~ is_a_theorem(implies(X1,X5)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(implies(implies(X4,implies(X5,X6)),implies(X2,implies(not(X5),not(X1)))),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
fof(c_0_12,negated_conjecture,
~ ! [X3,X4,X5] : is_a_theorem(implies(implies(X3,X4),implies(implies(X4,X5),implies(X3,X5)))),
inference(assume_negation,[status(cth)],[prove_cn_1]) ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
fof(c_0_14,negated_conjecture,
~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4))))
| ~ is_a_theorem(implies(X3,implies(implies(X5,implies(X4,X6)),implies(X2,implies(not(X4),not(X1)))))) ),
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(implies(implies(esk1_0,esk2_0),implies(implies(esk2_0,esk3_0),implies(esk1_0,esk3_0)))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL982+1 : TPTP v9.2.1. Released v9.1.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.16/0.33 % Computer : n008.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 23:20:13 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Theorem for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.371s
%------------------------------------------------------------------------------