%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : LAT388+1 : TPTP v9.2.1. Released v4.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 : n011.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 04:38:26 PM UTC 2026
% Result : Theorem 0.30s 1.62s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 6 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 4 ( 1 sgn 1 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] : aSupremumOfIn0(X1,xT,xS),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__1330,hypothesis,
( aFixedPointOf0(xp,xf)
& aSupremumOfIn0(xp,xT,xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1330) ).
fof(c_0_2,negated_conjecture,
~ ? [X1] : aSupremumOfIn0(X1,xT,xS),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_3,negated_conjecture,
! [X132] : ~ aSupremumOfIn0(X132,xT,xS),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).
cnf(c_0_4,hypothesis,
aSupremumOfIn0(xp,xT,xS),
inference(split_conjunct,[status(thm)],[m__1330]) ).
cnf(c_0_5,negated_conjecture,
~ aSupremumOfIn0(X1,xT,xS),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_4,c_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT388+1 : TPTP v9.2.1. Released v4.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.14/0.33 % Computer : n011.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 21:49:17 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.30/1.62 % Version : CSE_E---1.7
% 0.30/1.62 % Problem : theBenchmark.p
% 0.30/1.62 % SZS status Theorem for theBenchmark.p
% 0.30/1.62 % SZS output start CNFRefutation
% See solution above
% 0.30/1.62 % Total time : 1.269s
%------------------------------------------------------------------------------