%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWV034+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:57:59 AM UTC 2026
% Result : Theorem 6.85s 3.34s
% Output : Refutation 6.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 42 equ; 0 cnn)
% Maximal formula atoms : 59 ( 30 avg)
% Number of connectives : 322 ( 2 ~; 0 |; 90 &; 204 @)
% ( 0 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 13 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 23 con; 0-3 aty)
% Number of variables : 20 ( 0 ^; 20 !; 0 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
thf(s_best7_init_decl,type,
s_best7_init: $i ).
thf(init_decl,type,
init: $i ).
thf(s_sworst7_init_decl,type,
s_sworst7_init: $i ).
thf(s_worst7_init_decl,type,
s_worst7_init: $i ).
thf(leq_decl,type,
leq: $i > $i > $o ).
thf(n0_decl,type,
n0: $i ).
thf(s_best7_decl,type,
s_best7: $i ).
thf(s_sworst7_decl,type,
s_sworst7: $i ).
thf(s_worst7_decl,type,
s_worst7: $i ).
thf(pv19_decl,type,
pv19: $i ).
thf(n3_decl,type,
n3: $i ).
thf(minus_decl,type,
minus: $i > $i > $i ).
thf(n410_decl,type,
n410: $i ).
thf(n1_decl,type,
n1: $i ).
thf(n2_decl,type,
n2: $i ).
thf(a_select3_decl,type,
a_select3: $i > $i > $i > $i ).
thf(simplex7_init_decl,type,
simplex7_init: $i ).
thf(a_select2_decl,type,
a_select2: $i > $i > $i ).
thf(s_values7_init_decl,type,
s_values7_init: $i ).
thf(s_center7_init_decl,type,
s_center7_init: $i ).
thf(s_try7_init_decl,type,
s_try7_init: $i ).
thf(gt_decl,type,
gt: $i > $i > $o ).
thf(loopcounter_decl,type,
loopcounter: $i ).
thf(pvar1400_init_decl,type,
pvar1400_init: $i ).
thf(pvar1401_init_decl,type,
pvar1401_init: $i ).
thf(pvar1402_init_decl,type,
pvar1402_init: $i ).
thf(1,conjecture,
( ( ( ( n1 @ ( loopcounter @ gt ) )
=> ( ( pvar1402_init = init )
& ( pvar1401_init = init )
& ( pvar1400_init = init ) ) )
& ! [A: $i] :
( ( ( n1 @ ( n3 @ minus ) @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_try7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_center7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n3 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_values7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ! [B: $i] :
( ( ( n3 @ ( B @ leq ) )
& ( B @ ( n0 @ leq ) ) )
=> ( ( A @ ( B @ ( simplex7_init @ a_select3 ) ) )
= init ) ) )
& ( n1 @ ( n410 @ minus ) @ ( pv19 @ leq ) )
& ( n3 @ ( s_worst7 @ leq ) )
& ( n3 @ ( s_sworst7 @ leq ) )
& ( n3 @ ( s_best7 @ leq ) )
& ( pv19 @ ( n0 @ leq ) )
& ( s_worst7 @ ( n0 @ leq ) )
& ( s_sworst7 @ ( n0 @ leq ) )
& ( s_best7 @ ( n0 @ leq ) )
& ( s_worst7_init = init )
& ( s_sworst7_init = init )
& ( s_best7_init = init ) )
=> ( ( ( n1 @ ( loopcounter @ gt ) )
=> ( ( pvar1402_init = init )
& ( pvar1401_init = init )
& ( pvar1400_init = init ) ) )
& ! [A: $i] :
( ( ( n1 @ ( n3 @ minus ) @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_try7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_center7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n3 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_values7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ! [B: $i] :
( ( ( n3 @ ( B @ leq ) )
& ( B @ ( n0 @ leq ) ) )
=> ( ( A @ ( B @ ( simplex7_init @ a_select3 ) ) )
= init ) ) )
& ( n1 @ ( n410 @ minus ) @ ( pv19 @ leq ) )
& ( n3 @ ( s_worst7 @ leq ) )
& ( n3 @ ( s_sworst7 @ leq ) )
& ( n3 @ ( s_best7 @ leq ) )
& ( pv19 @ ( n0 @ leq ) )
& ( s_worst7 @ ( n0 @ leq ) )
& ( s_sworst7 @ ( n0 @ leq ) )
& ( s_best7 @ ( n0 @ leq ) )
& ( s_worst7_init = init )
& ( s_sworst7_init = init )
& ( s_best7_init = init )
& ( init = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0049) ).
thf(2,negated_conjecture,
~ ( ( ( ( n1 @ ( loopcounter @ gt ) )
=> ( ( pvar1402_init = init )
& ( pvar1401_init = init )
& ( pvar1400_init = init ) ) )
& ! [A: $i] :
( ( ( n1 @ ( n3 @ minus ) @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_try7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_center7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n3 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_values7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ! [B: $i] :
( ( ( n3 @ ( B @ leq ) )
& ( B @ ( n0 @ leq ) ) )
=> ( ( A @ ( B @ ( simplex7_init @ a_select3 ) ) )
= init ) ) )
& ( n1 @ ( n410 @ minus ) @ ( pv19 @ leq ) )
& ( n3 @ ( s_worst7 @ leq ) )
& ( n3 @ ( s_sworst7 @ leq ) )
& ( n3 @ ( s_best7 @ leq ) )
& ( pv19 @ ( n0 @ leq ) )
& ( s_worst7 @ ( n0 @ leq ) )
& ( s_sworst7 @ ( n0 @ leq ) )
& ( s_best7 @ ( n0 @ leq ) )
& ( s_worst7_init = init )
& ( s_sworst7_init = init )
& ( s_best7_init = init ) )
=> ( ( ( n1 @ ( loopcounter @ gt ) )
=> ( ( pvar1402_init = init )
& ( pvar1401_init = init )
& ( pvar1400_init = init ) ) )
& ! [A: $i] :
( ( ( n1 @ ( n3 @ minus ) @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_try7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_center7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n3 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ( ( A @ ( s_values7_init @ a_select2 ) )
= init ) )
& ! [A: $i] :
( ( ( n2 @ ( A @ leq ) )
& ( A @ ( n0 @ leq ) ) )
=> ! [B: $i] :
( ( ( n3 @ ( B @ leq ) )
& ( B @ ( n0 @ leq ) ) )
=> ( ( A @ ( B @ ( simplex7_init @ a_select3 ) ) )
= init ) ) )
& ( n1 @ ( n410 @ minus ) @ ( pv19 @ leq ) )
& ( n3 @ ( s_worst7 @ leq ) )
& ( n3 @ ( s_sworst7 @ leq ) )
& ( n3 @ ( s_best7 @ leq ) )
& ( pv19 @ ( n0 @ leq ) )
& ( s_worst7 @ ( n0 @ leq ) )
& ( s_sworst7 @ ( n0 @ leq ) )
& ( s_best7 @ ( n0 @ leq ) )
& ( s_worst7_init = init )
& ( s_sworst7_init = init )
& ( s_best7_init = init )
& ( init = init ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(92,plain,
~ $true,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(93,plain,
$false,
inference(simp,[status(thm)],[92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV034+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.14/0.41 % Computer : n005.cluster.edu
% 0.14/0.41 % Model : x86_64 x86_64
% 0.14/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41 % Memory : 8046.5625MB
% 0.14/0.41 % OS : Linux 6.8.0-71-generic
% 0.14/0.41 % CPULimit : 300
% 0.14/0.41 % WCLimit : 300
% 0.14/0.41 % DateTime : Sat Sep 26 13:07:02 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.85/0.99 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.37/1.28 % [INFO] Parsing done (290ms).
% 1.80/1.30 % [INFO] Running in sequential loop mode.
% 2.26/1.68 % [INFO] eprover registered as external prover.
% 2.26/1.69 % [INFO] Scanning for conjecture ...
% 2.65/1.85 % [INFO] Found a conjecture (or negated_conjecture) and 91 axioms. Running axiom selection ...
% 2.88/1.98 % [INFO] Axiom selection finished. Selected 89 axioms (removed 2 axioms).
% 3.18/2.10 % [INFO] Problem is first-order (TPTP FOF).
% 3.18/2.12 % [INFO] Type checking passed.
% 3.42/2.13 % [CONFIG] Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>. Searching for refutation ...
% 6.85/3.34 % [INFO] Killing All external provers ...
% 6.85/3.34 % Time passed: 2784ms (effective reasoning time: 2033ms)
% 6.85/3.34 % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 6.85/3.34 % Axioms used in derivation (0):
% 6.85/3.34 % No. of inferences in proof: 4
% 6.85/3.34 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2784 ms resp. 2033 ms w/o parsing
% 6.85/3.39 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.85/3.39 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------