%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN072+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 : n028.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:03 PM UTC 2026
% Result : Theorem 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 41 ( 26 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 28 ( 11 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 14 ( 0 sgn 4 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel49,conjecture,
! [X1] : big_p(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49) ).
fof(pel49_1,axiom,
? [X1,X2] :
! [X3] :
( X3 = X1
| X3 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_1) ).
fof(pel49_3,axiom,
big_p(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_3) ).
fof(pel49_2,axiom,
big_p(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_2) ).
fof(pel49_4,axiom,
a != b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel49_4) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] : big_p(X1),
inference(assume_negation,[status(cth)],[pel49]) ).
fof(c_0_6,negated_conjecture,
~ big_p(esk3_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_7,plain,
! [X10] :
( X10 = esk1_0
| X10 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel49_1])]) ).
cnf(c_0_8,negated_conjecture,
~ big_p(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X1 = esk1_0
| X1 = esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
( esk3_0 = esk1_0
| ~ big_p(esk2_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,negated_conjecture,
( esk3_0 = esk1_0
| X1 = esk1_0
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
big_p(b),
inference(split_conjunct,[status(thm)],[pel49_3]) ).
cnf(c_0_13,negated_conjecture,
( esk1_0 = b
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
big_p(a),
inference(split_conjunct,[status(thm)],[pel49_2]) ).
cnf(c_0_15,negated_conjecture,
( esk1_0 = b
| ~ big_p(esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_16,plain,
( X1 = esk1_0
| X2 = esk1_0
| X2 = X1 ),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( esk1_0 = a
| esk3_0 = esk1_0 ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk1_0
| X2 = b
| X1 = X2
| ~ big_p(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
a != b,
inference(split_conjunct,[status(thm)],[pel49_4]) ).
cnf(c_0_20,negated_conjecture,
( esk1_0 = a
| ~ big_p(esk1_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( X1 = a
| X1 = esk1_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( X1 = a
| ~ big_p(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_12]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN072+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.15/0.33 % Computer : n028.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 08:12:31 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Theorem for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.368s
%------------------------------------------------------------------------------