%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN054+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 : n014.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:55 PM UTC 2026
% Result : Theorem 1.25s 1.72s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 4 unt; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 40 ( 18 ~; 15 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 17 ( 2 sgn 6 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel24_4,axiom,
! [X1] :
( ( big_q(X1)
| big_r(X1) )
=> big_s(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel24_4) ).
fof(pel24_1,axiom,
~ ? [X1] :
( big_s(X1)
& big_q(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel24_1) ).
fof(pel24,conjecture,
? [X1] :
( big_p(X1)
& big_r(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel24) ).
fof(pel24_3,axiom,
( ~ ? [X1] : big_p(X1)
=> ? [X2] : big_q(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel24_3) ).
fof(pel24_2,axiom,
! [X1] :
( big_p(X1)
=> ( big_q(X1)
| big_r(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel24_2) ).
fof(c_0_5,plain,
! [X13] :
( ( ~ big_q(X13)
| big_s(X13) )
& ( ~ big_r(X13)
| big_s(X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel24_4])])]) ).
fof(c_0_6,plain,
! [X9] :
( ~ big_s(X9)
| ~ big_q(X9) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel24_1])]) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] :
( big_p(X1)
& big_r(X1) ),
inference(assume_negation,[status(cth)],[pel24]) ).
fof(c_0_8,plain,
( big_p(esk1_0)
| big_q(esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel24_3])])]) ).
cnf(c_0_9,plain,
( big_s(X1)
| ~ big_q(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ big_s(X1)
| ~ big_q(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X10] :
( ~ big_p(X10)
| big_q(X10)
| big_r(X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel24_2])]) ).
fof(c_0_12,negated_conjecture,
! [X14] :
( ~ big_p(X14)
| ~ big_r(X14) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
cnf(c_0_13,plain,
( big_p(esk1_0)
| big_q(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
~ big_q(X1),
inference(csr,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( big_q(X1)
| big_r(X1)
| ~ big_p(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ big_p(X1)
| ~ big_r(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
big_p(esk1_0),
inference(sr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
~ big_p(X1),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_15,c_0_14]),c_0_16]) ).
cnf(c_0_19,plain,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN054+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 : n014.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:51 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.25/1.72 % Version : CSE_E---1.7
% 1.25/1.72 % Problem : theBenchmark.p
% 1.25/1.72 % SZS status Theorem for theBenchmark.p
% 1.25/1.72 % SZS output start CNFRefutation
% See solution above
% 1.25/1.72 % Total time : 1.375s
%------------------------------------------------------------------------------