%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN065+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 : n021.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:59 PM UTC 2026
% Result : Theorem 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 11 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 42 ( 19 ~; 18 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 32 ( 1 sgn 13 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel36,conjecture,
! [X1] :
? [X2] : big_h(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36) ).
fof(pel36_3,axiom,
! [X1,X2] :
( ( big_f(X1,X2)
| big_g(X1,X2) )
=> ! [X3] :
( ( big_f(X2,X3)
| big_g(X2,X3) )
=> big_h(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_3) ).
fof(pel36_2,axiom,
! [X1] :
? [X2] : big_g(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_2) ).
fof(pel36_1,axiom,
! [X1] :
? [X2] : big_f(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel36_1) ).
fof(i_0_4,negated_conjecture,
~ ! [X1] :
? [X2] : big_h(X1,X2),
inference(assume_negation,[status(cth)],[pel36]) ).
fof(i_0_5,plain,
! [X17,X18,X19] :
( ( ~ big_f(X18,X19)
| big_h(X17,X19)
| ~ big_f(X17,X18) )
& ( ~ big_g(X18,X19)
| big_h(X17,X19)
| ~ big_f(X17,X18) )
& ( ~ big_f(X18,X19)
| big_h(X17,X19)
| ~ big_g(X17,X18) )
& ( ~ big_g(X18,X19)
| big_h(X17,X19)
| ~ big_g(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel36_3])])])]) ).
fof(i_0_6,plain,
! [X15] : big_g(X15,esk2_1(X15)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel36_2])]) ).
fof(i_0_7,plain,
! [X13] : big_f(X13,esk1_1(X13)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel36_1])]) ).
fof(i_0_8,negated_conjecture,
! [X21] : ~ big_h(esk3_0,X21),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_4])])]) ).
cnf(i_0_9,plain,
( big_h(X3,X2)
| ~ big_g(X1,X2)
| ~ big_g(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_10,plain,
( big_h(X3,X2)
| ~ big_f(X1,X2)
| ~ big_g(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_11,plain,
( big_h(X3,X2)
| ~ big_g(X1,X2)
| ~ big_f(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_12,plain,
( big_h(X3,X2)
| ~ big_f(X1,X2)
| ~ big_f(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_13,plain,
big_g(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_14,plain,
big_f(X1,esk1_1(X1)),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_15,negated_conjecture,
~ big_h(esk3_0,X1),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_16,plain,
$false,
inference(scs_inference,[],[i_0_15,i_0_14,i_0_13,i_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN065+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.14/0.33 % Computer : n021.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 08:10:10 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Theorem for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.63 % Total time : 1.270s
%------------------------------------------------------------------------------