%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SYN731+1 : TPTP v9.2.1. Released v2.5.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 : n001.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:40:11 PM UTC 2026
% Result : Theorem 0.26s 1.62s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 16 ( 1 sgn 6 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(x2150,conjecture,
? [X1] :
( ! [X2] :
? [X3] : p(X1,X2,X3)
=> ? [X4] : p(X4,X4,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2150) ).
fof(c_0_1,negated_conjecture,
~ ? [X1] :
( ! [X2] :
? [X3] : p(X1,X2,X3)
=> ? [X4] : p(X4,X4,X1) ),
inference(assume_negation,[status(cth)],[x2150]) ).
fof(c_0_2,negated_conjecture,
! [X9,X10,X12,X13] :
( p(X9,X10,esk1_2(X9,X10))
& ~ p(X13,X13,X12) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
cnf(c_0_3,negated_conjecture,
~ p(X1,X1,X2),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_4,negated_conjecture,
p(X1,X2,esk1_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
cnf(c_0_5,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_3,c_0_4]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN731+1 : TPTP v9.2.1. Released v2.5.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.15/0.33 % Computer : n001.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:45:48 EDT 2026
% 0.15/0.34 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 0.26/1.62 % Version : CSE_E---1.7
% 0.26/1.62 % Problem : theBenchmark.p
% 0.26/1.62 % SZS status Theorem for theBenchmark.p
% 0.26/1.62 % SZS output start CNFRefutation
% See solution above
% 0.26/1.62 % Total time : 1.273s
%------------------------------------------------------------------------------