%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN940+1 : TPTP v9.2.1. Released v3.1.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 : n022.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:51:07 PM UTC 2026
% Result : Theorem 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 7 unt; 0 def)
% Number of atoms : 58 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 70 ( 31 ~; 24 |; 9 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 32 ( 13 sgn 9 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
! [X1,X2] :
( ! [X3] : q(f(X3))
=> ? [X4,X5] :
( ( p(f(X5))
=> ( p(X4)
& ( r(X5)
=> ( r(X1)
& r(X2) ) ) ) )
& q(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
fof(i_0_1,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] : q(f(X3))
=> ? [X4,X5] :
( ( p(f(X5))
=> ( p(X4)
& ( r(X5)
=> ( r(X1)
& r(X2) ) ) ) )
& q(X4) ) ),
inference(assume_negation,[status(cth)],[prove_this]) ).
fof(i_0_2,negated_conjecture,
! [X13,X14,X15] :
( q(f(X13))
& ( p(f(X15))
| ~ q(X14) )
& ( r(X15)
| ~ p(X14)
| ~ q(X14) )
& ( ~ r(esk1_0)
| ~ r(esk2_0)
| ~ p(X14)
| ~ q(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_1])])])])]) ).
cnf(i_0_3,negated_conjecture,
( ~ r(esk1_0)
| ~ r(esk2_0)
| ~ p(X1)
| ~ q(X1) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_4,negated_conjecture,
( r(X1)
| ~ p(X2)
| ~ q(X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_5,negated_conjecture,
( p(f(X1))
| ~ q(X2) ),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_6,negated_conjecture,
q(f(X1)),
inference(split_conjunct,[status(thm)],[i_0_2]),
[final] ).
cnf(i_0_7,plain,
p(f(X1)),
inference(scs_inference,[],[i_0_6,i_0_5]) ).
cnf(i_0_8,plain,
( r(X1)
| ~ p(f(X2)) ),
inference(scs_inference,[],[i_0_6,i_0_4]) ).
cnf(i_0_9,plain,
( ~ q(X1)
| r(X2)
| ~ p(X1) ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_10,plain,
( ~ p(f(X1))
| ~ r(esk2_0) ),
inference(scs_inference,[],[i_0_6,i_0_4,i_0_3]) ).
cnf(i_0_11,plain,
( ~ r(esk1_0)
| ~ r(esk2_0)
| ~ q(X1)
| ~ p(X1) ),
inference(rename_variables,[],[i_0_3]) ).
cnf(i_0_12,plain,
r(X1),
inference(scs_inference,[],[i_0_6,i_0_7,i_0_4]) ).
cnf(i_0_13,plain,
q(f(X1)),
inference(rename_variables,[],[i_0_6]) ).
cnf(i_0_14,plain,
( ~ q(X1)
| r(X2)
| ~ p(X1) ),
inference(rename_variables,[],[i_0_4]) ).
cnf(i_0_15,plain,
~ r(esk2_0),
inference(scs_inference,[],[i_0_6,i_0_13,i_0_7,i_0_4,i_0_3]) ).
cnf(i_0_16,plain,
q(f(X1)),
inference(rename_variables,[],[i_0_6]) ).
cnf(i_0_17,plain,
( ~ r(esk1_0)
| ~ r(esk2_0)
| ~ q(X1)
| ~ p(X1) ),
inference(rename_variables,[],[i_0_3]) ).
cnf(i_0_18,plain,
$false,
inference(scs_inference,[],[i_0_6,i_0_13,i_0_7,i_0_4,i_0_3,i_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SYN940+1 : TPTP v9.2.1. Released v3.1.0.
% 0.00/0.11 % 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.16/0.32 % Computer : n022.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 08:50:36 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Theorem for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.268s
%------------------------------------------------------------------------------