%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN068+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 : n012.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:36:02 PM UTC 2026
% Result : Theorem 1.10s 1.62s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 44 ( 18 ~; 10 |; 13 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 17 ( 0 sgn 6 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel44,conjecture,
? [X1] :
( big_j(X1)
& ~ big_f(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel44) ).
fof(pel44_1,axiom,
! [X1] :
( big_f(X1)
=> ( ? [X2] :
( big_g(X2)
& big_h(X1,X2) )
& ? [X3] :
( big_g(X3)
& ~ big_h(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel44_1) ).
fof(pel44_2,axiom,
? [X1] :
( big_j(X1)
& ! [X2] :
( big_g(X2)
=> big_h(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel44_2) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( big_j(X1)
& ~ big_f(X1) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel44])]) ).
fof(c_0_4,plain,
! [X1] :
( big_f(X1)
=> ( ? [X2] :
( big_g(X2)
& big_h(X1,X2) )
& ? [X3] :
( big_g(X3)
& ~ big_h(X1,X3) ) ) ),
inference(fof_simplification,[status(thm)],[pel44_1]) ).
fof(c_0_5,negated_conjecture,
! [X15] :
( ~ big_j(X15)
| big_f(X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_6,plain,
! [X14] :
( big_j(esk3_0)
& ( ~ big_g(X14)
| big_h(esk3_0,X14) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel44_2])])])]) ).
fof(c_0_7,plain,
! [X10] :
( ( big_g(esk1_1(X10))
| ~ big_f(X10) )
& ( big_h(X10,esk1_1(X10))
| ~ big_f(X10) )
& ( big_g(esk2_1(X10))
| ~ big_f(X10) )
& ( ~ big_h(X10,esk2_1(X10))
| ~ big_f(X10) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,negated_conjecture,
( big_f(X1)
| ~ big_j(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
big_j(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ big_h(X1,esk2_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( big_h(esk3_0,X1)
| ~ big_g(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
big_f(esk3_0),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
~ big_g(esk2_1(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_14,plain,
( big_g(esk2_1(X1))
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN068+1 : TPTP v9.2.1. Released v2.0.0.
% 0.00/0.07 % 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.06/0.25 % Computer : n012.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Tue May 5 08:10:46 EDT 2026
% 0.06/0.25 % CPUTime :
% 0.06/0.26 % start to proof: theBenchmark
% 1.10/1.62 % Version : CSE_E---1.7
% 1.10/1.62 % Problem : theBenchmark.p
% 1.10/1.62 % SZS status Theorem for theBenchmark.p
% 1.10/1.62 % SZS output start CNFRefutation
% See solution above
% 1.10/1.62 % Total time : 1.361s
%------------------------------------------------------------------------------