%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN055+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 : n004.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 0.28s 5.63s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 7 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 63 ( 28 ~; 22 |; 9 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 22 ( 0 sgn 8 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel25_2,axiom,
! [X1] :
( big_f(X1)
=> ( ~ big_g(X1)
& big_r(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel25_2) ).
fof(pel25,conjecture,
? [X1] :
( big_q(X1)
& big_p(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel25) ).
fof(pel25_4,axiom,
( ! [X1] :
( big_p(X1)
=> big_q(X1) )
| ? [X2] :
( big_p(X2)
& big_r(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel25_4) ).
fof(pel25_3,axiom,
! [X1] :
( big_p(X1)
=> ( big_g(X1)
& big_f(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel25_3) ).
fof(pel25_1,axiom,
? [X1] : big_p(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel25_1) ).
fof(i_0_5,plain,
! [X1] :
( big_f(X1)
=> ( ~ big_g(X1)
& big_r(X1) ) ),
inference(fof_simplification,[status(thm)],[pel25_2]) ).
fof(i_0_6,negated_conjecture,
~ ? [X1] :
( big_q(X1)
& big_p(X1) ),
inference(assume_negation,[status(cth)],[pel25]) ).
fof(i_0_7,plain,
! [X12] :
( ( big_p(esk2_0)
| ~ big_p(X12)
| big_q(X12) )
& ( big_r(esk2_0)
| ~ big_p(X12)
| big_q(X12) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel25_4])])])])]) ).
fof(i_0_8,plain,
! [X10] :
( ( ~ big_g(X10)
| ~ big_f(X10) )
& ( big_r(X10)
| ~ big_f(X10) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).
fof(i_0_9,negated_conjecture,
! [X14] :
( ~ big_q(X14)
| ~ big_p(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_6])]) ).
fof(i_0_10,plain,
! [X11] :
( ( big_g(X11)
| ~ big_p(X11) )
& ( big_f(X11)
| ~ big_p(X11) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel25_3])])]) ).
fof(i_0_11,plain,
big_p(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel25_1])]) ).
cnf(i_0_12,plain,
( big_r(esk2_0)
| big_q(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,plain,
( big_p(esk2_0)
| big_q(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_14,plain,
( ~ big_g(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_15,negated_conjecture,
( ~ big_q(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_16,plain,
( big_r(X1)
| ~ big_f(X1) ),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_17,plain,
( big_g(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_18,plain,
( big_f(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_19,plain,
big_p(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_20,plain,
~ big_q(esk1_0),
inference(scs_inference,[],[i_0_19,i_0_15]) ).
cnf(i_0_21,plain,
( ~ big_p(X1)
| ~ big_q(X1) ),
inference(rename_variables,[],[i_0_15]) ).
cnf(i_0_22,plain,
big_f(esk1_0),
inference(scs_inference,[],[i_0_19,i_0_15,i_0_18]) ).
cnf(i_0_23,plain,
( ~ big_p(X1)
| big_f(X1) ),
inference(rename_variables,[],[i_0_18]) ).
cnf(i_0_24,plain,
~ big_g(esk1_0),
inference(scs_inference,[],[i_0_19,i_0_15,i_0_18,i_0_14]) ).
cnf(i_0_25,plain,
( ~ big_f(X1)
| ~ big_g(X1) ),
inference(rename_variables,[],[i_0_14]) ).
cnf(i_0_26,plain,
$false,
inference(scs_inference,[],[i_0_19,i_0_15,i_0_18,i_0_14,i_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN055+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.16/0.33 % Computer : n004.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 08:08:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.28/5.63 % Version : CSE_E---1.7
% 0.28/5.63 % Problem : theBenchmark.p
% 0.28/5.63 % SZS status Theorem for theBenchmark.p
% 0.28/5.63 % SZS output start CNFRefutation
% See solution above
% 0.28/5.65 % Total time : 5.281s
%------------------------------------------------------------------------------