%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN062+1 : TPTP v9.2.1. Released v2.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 : 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 05:35:58 PM UTC 2026
% Result : Theorem 0.24s 1.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 50 ( 20 ~; 18 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel32,conjecture,
! [X1] :
( ( big_f(X1)
& big_k(X1) )
=> big_j(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel32) ).
fof(pel32_2,axiom,
! [X1] :
( ( big_i(X1)
& big_h(X1) )
=> big_j(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel32_2) ).
fof(pel32_1,axiom,
! [X1] :
( ( big_f(X1)
& ( big_g(X1)
| big_h(X1) ) )
=> big_i(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel32_1) ).
fof(pel32_3,axiom,
! [X1] :
( big_k(X1)
=> big_h(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel32_3) ).
fof(i_0_4,negated_conjecture,
~ ! [X1] :
( ( big_f(X1)
& big_k(X1) )
=> big_j(X1) ),
inference(assume_negation,[status(cth)],[pel32]) ).
fof(i_0_5,plain,
! [X7] :
( ~ big_i(X7)
| ~ big_h(X7)
| big_j(X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_2])]) ).
fof(i_0_6,plain,
! [X6] :
( ( ~ big_g(X6)
| ~ big_f(X6)
| big_i(X6) )
& ( ~ big_h(X6)
| ~ big_f(X6)
| big_i(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_1])])]) ).
fof(i_0_7,plain,
! [X8] :
( ~ big_k(X8)
| big_h(X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel32_3])]) ).
fof(i_0_8,negated_conjecture,
( big_f(esk1_0)
& big_k(esk1_0)
& ~ big_j(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_4])])]) ).
cnf(i_0_9,plain,
( big_j(X1)
| ~ big_i(X1)
| ~ big_h(X1) ),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_10,plain,
( big_i(X1)
| ~ big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_11,plain,
( big_i(X1)
| ~ big_g(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_12,plain,
( big_h(X1)
| ~ big_k(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,negated_conjecture,
~ big_j(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_14,negated_conjecture,
big_k(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_15,negated_conjecture,
big_f(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_16,plain,
big_h(esk1_0),
inference(scs_inference,[],[i_0_14,i_0_12]) ).
cnf(i_0_17,plain,
( ~ big_k(X1)
| big_h(X1) ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_18,plain,
big_i(esk1_0),
inference(scs_inference,[],[i_0_14,i_0_15,i_0_12,i_0_10]) ).
cnf(i_0_19,plain,
( ~ big_h(X1)
| ~ big_f(X1)
| big_i(X1) ),
inference(rename_variables,[],[i_0_10]) ).
cnf(i_0_20,plain,
$false,
inference(scs_inference,[],[i_0_13,i_0_14,i_0_15,i_0_12,i_0_10,i_0_9]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN062+1 : TPTP v9.2.1. Released v2.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 : n008.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 : Tue May 5 08:10:58 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.24/1.62 % Version : CSE_E---1.7
% 0.24/1.62 % Problem : theBenchmark.p
% 0.24/1.62 % SZS status Theorem for theBenchmark.p
% 0.24/1.62 % SZS output start CNFRefutation
% See solution above
% 0.24/1.64 % Total time : 1.273s
%------------------------------------------------------------------------------