%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% Computer : n018.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:57 AM UTC 2026
% Result : Unsatisfiable 3.44s 2.28s
% Output : Refutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 45 ( 4 equ; 0 cnn)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 148 ( 22 ~; 24 |; 0 &; 102 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 14 ( 0 ^; 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(in_array_bounds_decl,type,
in_array_bounds: $i > $i > $o ).
thf(array_decl,type,
array: $i ).
thf(an_index_decl,type,
an_index: $i ).
thf(less_than_decl,type,
less_than: $i > $i > $o ).
thf(successor_decl,type,
successor: $i > $i ).
thf(lower_bound_decl,type,
lower_bound: $i ).
thf(upper_bound_decl,type,
upper_bound: $i ).
thf(index_of_maximal_decl,type,
index_of_maximal: $i ).
thf(maximal_value_decl,type,
maximal_value: $i ).
thf(array_value_at_decl,type,
array_value_at: $i > $i > $i ).
thf(2,axiom,
! [A: $i] :
( ( A @ ( array @ in_array_bounds ) )
| ( A @ ( upper_bound @ less_than ) )
| ( lower_bound @ ( A @ less_than ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_bounds) ).
thf(14,plain,
! [A: $i] :
( ( A @ ( array @ in_array_bounds ) )
| ( A @ ( upper_bound @ less_than ) )
| ( lower_bound @ ( A @ less_than ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(6,axiom,
( ( maximal_value
= ( index_of_maximal @ ( array @ array_value_at ) ) )
| ~ ( index_of_maximal @ ( array @ in_array_bounds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',this_is_maximal) ).
thf(21,plain,
( ( maximal_value
= ( index_of_maximal @ ( array @ array_value_at ) ) )
| ~ ( index_of_maximal @ ( array @ in_array_bounds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(9,axiom,
~ ( an_index @ ( upper_bound @ less_than ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_below_upper_bound) ).
thf(27,plain,
~ ( an_index @ ( upper_bound @ less_than ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ less_than ) )
| ~ ( C @ ( B @ less_than ) )
| ~ ( B @ ( A @ less_than ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ( C @ ( A @ less_than ) )
| ~ ( C @ ( B @ less_than ) )
| ~ ( B @ ( A @ less_than ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [B: $i,A: $i] :
( ( B @ ( A @ less_than ) )
| ~ ( B @ successor @ ( A @ successor @ less_than ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',predecessor_less) ).
thf(16,plain,
! [B: $i,A: $i] :
( ( B @ ( A @ less_than ) )
| ~ ( B @ successor @ ( A @ successor @ less_than ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(1,negated_conjecture,
( ( maximal_value
!= ( index_of_maximal @ ( array @ array_value_at ) ) )
| ~ ( index_of_maximal @ ( array @ in_array_bounds ) )
| ~ ( an_index @ successor @ ( index_of_maximal @ less_than ) )
| ( lower_bound @ ( index_of_maximal @ less_than ) )
| ( an_index @ successor @ ( upper_bound @ successor @ less_than ) )
| ( lower_bound @ ( an_index @ successor @ less_than ) )
| ~ ( an_index @ ( array @ in_array_bounds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
thf(11,plain,
( ( maximal_value
!= ( index_of_maximal @ ( array @ array_value_at ) ) )
| ~ ( index_of_maximal @ ( array @ in_array_bounds ) )
| ~ ( an_index @ successor @ ( index_of_maximal @ less_than ) )
| ( lower_bound @ ( index_of_maximal @ less_than ) )
| ( an_index @ successor @ ( upper_bound @ successor @ less_than ) )
| ( lower_bound @ ( an_index @ successor @ less_than ) )
| ~ ( an_index @ ( array @ in_array_bounds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(7,axiom,
an_index @ ( index_of_maximal @ less_than ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_before_somewhere) ).
thf(24,plain,
an_index @ ( index_of_maximal @ less_than ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(8,axiom,
~ ( lower_bound @ ( an_index @ less_than ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',somewhere_above_lower_bound) ).
thf(25,plain,
~ ( lower_bound @ ( an_index @ less_than ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(5,axiom,
! [A: $i] : ( A @ successor @ ( A @ less_than ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_greater) ).
thf(20,plain,
! [A: $i] : ( A @ successor @ ( A @ less_than ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(10,axiom,
~ ( lower_bound @ ( index_of_maximal @ less_than ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maximal_above_lower_bound) ).
thf(29,plain,
~ ( lower_bound @ ( index_of_maximal @ less_than ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(31,plain,
$false,
inference(e,[status(thm)],[14,21,27,18,16,11,24,25,20,29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV019-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.12/0.40 % Computer : n018.cluster.edu
% 0.12/0.40 % Model : x86_64 x86_64
% 0.12/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40 % Memory : 8046.5625MB
% 0.12/0.40 % OS : Linux 6.8.0-71-generic
% 0.12/0.40 % CPULimit : 300
% 0.12/0.40 % WCLimit : 300
% 0.12/0.40 % DateTime : Sat Sep 26 13:08:23 UTC 2026
% 0.12/0.40 % CPUTime :
% 0.12/0.40 Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.88/0.97 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.31/1.17 % [INFO] Parsing done (195ms).
% 1.31/1.19 % [INFO] Running in sequential loop mode.
% 1.89/1.59 % [INFO] eprover registered as external prover.
% 2.09/1.60 % [INFO] Scanning for conjecture ...
% 2.09/1.69 % [INFO] Found a conjecture (or negated_conjecture) and 9 axioms. Running axiom selection ...
% 2.26/1.73 % [INFO] Axiom selection finished. Selected 9 axioms (removed 0 axioms).
% 2.26/1.74 % [INFO] Problem is propositional (TPTP CNF).
% 2.26/1.75 % [INFO] Type checking passed.
% 2.26/1.75 % [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 ...
% 3.44/2.27 % External prover 'e' found a proof!
% 3.44/2.28 % [INFO] Killing All external provers ...
% 3.44/2.28 % Time passed: 1739ms (effective reasoning time: 1083ms)
% 3.44/2.28 % Axioms used in derivation (9): maximal_before_somewhere, somewhere_below_upper_bound, successor_greater, this_is_maximal, somewhere_above_lower_bound, transitivity_of_less, in_bounds, maximal_above_lower_bound, predecessor_less
% 3.44/2.28 % No. of inferences in proof: 21
% 3.44/2.28 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1739 ms resp. 1083 ms w/o parsing
% 3.70/2.32 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.70/2.32 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------