%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN057+1 : TPTP v9.2.1. Released v2.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 : 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:56 PM UTC 2026
% Result : Theorem 1.23s 1.72s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 7 unt; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 28 ~; 15 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 19 ( 0 sgn 10 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel27_4,axiom,
( ? [X1] :
( big_h(X1)
& ~ big_g(X1) )
=> ! [X2] :
( big_i(X2)
=> ~ big_h(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_4) ).
fof(pel27,conjecture,
! [X1] :
( big_j(X1)
=> ~ big_i(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27) ).
fof(pel27_1,axiom,
? [X1] :
( big_f(X1)
& ~ big_g(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_1) ).
fof(pel27_2,axiom,
! [X1] :
( big_f(X1)
=> big_h(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_2) ).
fof(pel27_3,axiom,
! [X1] :
( ( big_j(X1)
& big_i(X1) )
=> big_f(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel27_3) ).
fof(c_0_5,plain,
( ? [X1] :
( big_h(X1)
& ~ big_g(X1) )
=> ! [X2] :
( big_i(X2)
=> ~ big_h(X2) ) ),
inference(fof_simplification,[status(thm)],[pel27_4]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( big_j(X1)
=> ~ big_i(X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel27])]) ).
fof(c_0_7,plain,
? [X1] :
( big_f(X1)
& ~ big_g(X1) ),
inference(fof_simplification,[status(thm)],[pel27_1]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ~ big_h(X12)
| big_g(X12)
| ~ big_i(X13)
| ~ big_h(X13) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,negated_conjecture,
( big_j(esk2_0)
& big_i(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
( big_f(esk1_0)
& ~ big_g(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_11,plain,
( big_g(X1)
| ~ big_h(X1)
| ~ big_i(X2)
| ~ big_h(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
big_i(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
~ big_g(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( big_g(X1)
| ~ big_h(esk2_0)
| ~ big_h(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X10] :
( ~ big_f(X10)
| big_h(X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel27_2])]) ).
fof(c_0_16,plain,
! [X11] :
( ~ big_j(X11)
| ~ big_i(X11)
| big_f(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel27_3])]) ).
cnf(c_0_17,negated_conjecture,
( ~ big_h(esk2_0)
| ~ big_h(esk1_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( big_h(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
big_f(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( big_f(X1)
| ~ big_j(X1)
| ~ big_i(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
big_j(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ big_h(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_23,negated_conjecture,
big_f(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12])]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN057+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.12 % 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.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:07:58 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.23/1.72 % Version : CSE_E---1.7
% 1.23/1.72 % Problem : theBenchmark.p
% 1.23/1.72 % SZS status Theorem for theBenchmark.p
% 1.23/1.72 % SZS output start CNFRefutation
% See solution above
% 1.23/1.72 % Total time : 1.375s
%------------------------------------------------------------------------------