%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN060+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 : n027.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:57 PM UTC 2026
% Result : Theorem 0.27s 1.64s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 52 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 47 ( 18 ~; 17 |; 6 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 17 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel30_1,axiom,
! [X1] :
( ( big_f(X1)
| big_g(X1) )
=> ~ big_h(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30_1) ).
fof(pel30_2,axiom,
! [X1] :
( ( big_g(X1)
=> ~ big_i(X1) )
=> ( big_f(X1)
& big_h(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30_2) ).
fof(pel30,conjecture,
! [X1] : big_i(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel30) ).
fof(i_0_3,plain,
! [X1] :
( ( big_f(X1)
| big_g(X1) )
=> ~ big_h(X1) ),
inference(fof_simplification,[status(thm)],[pel30_1]) ).
fof(i_0_4,plain,
! [X1] :
( ( big_g(X1)
=> ~ big_i(X1) )
=> ( big_f(X1)
& big_h(X1) ) ),
inference(fof_simplification,[status(thm)],[pel30_2]) ).
fof(i_0_5,negated_conjecture,
~ ! [X1] : big_i(X1),
inference(assume_negation,[status(cth)],[pel30]) ).
fof(i_0_6,plain,
! [X5] :
( ( ~ big_f(X5)
| ~ big_h(X5) )
& ( ~ big_g(X5)
| ~ big_h(X5) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_3])])]) ).
fof(i_0_7,plain,
! [X6] :
( ( big_f(X6)
| big_g(X6) )
& ( big_h(X6)
| big_g(X6) )
& ( big_f(X6)
| big_i(X6) )
& ( big_h(X6)
| big_i(X6) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_4])])]) ).
fof(i_0_8,negated_conjecture,
~ big_i(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).
cnf(i_0_9,plain,
( ~ big_g(X1)
| ~ big_h(X1) ),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_10,plain,
( ~ big_f(X1)
| ~ big_h(X1) ),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_11,plain,
( big_h(X1)
| big_i(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_12,plain,
( big_h(X1)
| big_g(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,plain,
( big_f(X1)
| big_i(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_14,plain,
( big_f(X1)
| big_g(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_15,negated_conjecture,
~ big_i(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_15,i_0_11]) ).
cnf(i_0_17,plain,
( big_i(X1)
| big_h(X1) ),
inference(rename_variables,[],[i_0_11]) ).
cnf(i_0_18,plain,
~ big_g(esk1_0),
inference(scs_inference,[],[i_0_15,i_0_11,i_0_9]) ).
cnf(i_0_19,plain,
( ~ big_h(X1)
| ~ big_g(X1) ),
inference(rename_variables,[],[i_0_9]) ).
cnf(i_0_20,plain,
big_f(esk1_0),
inference(scs_inference,[],[i_0_15,i_0_11,i_0_9,i_0_13]) ).
cnf(i_0_21,plain,
( big_i(X1)
| big_f(X1) ),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_22,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_11,i_0_9,i_0_13,i_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.14 % Problem : SYN060+1 : TPTP v9.2.1. Released v2.0.0.
% 0.11/0.14 % 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.18/0.35 % Computer : n027.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Tue May 5 08:10:20 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.18/0.37 % start to proof: theBenchmark
% 0.27/1.64 % Version : CSE_E---1.7
% 0.27/1.64 % Problem : theBenchmark.p
% 0.27/1.64 % SZS status Theorem for theBenchmark.p
% 0.27/1.64 % SZS output start CNFRefutation
% See solution above
% 0.27/1.67 % Total time : 1.275s
%------------------------------------------------------------------------------