%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : SWV061+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 : n012.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:58:02 AM UTC 2026
% Result : Theorem 4.46s 11.90s
% Output : Refutation 4.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 0 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 56 ( 15 ~; 5 |; 7 &; 20 @)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 ^; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
thf(true_decl,type,
true: $o ).
thf(gt_decl,type,
gt: $i > $i > $o ).
thf(loopcounter_decl,type,
loopcounter: $i ).
thf(n1_decl,type,
n1: $i ).
thf(1,conjecture,
( true
=> ( ( ( n1 @ ( loopcounter @ gt ) )
=> true )
& ( ~ ( n1 @ ( loopcounter @ gt ) )
=> true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0002) ).
thf(2,negated_conjecture,
~ ( true
=> ( ( ( n1 @ ( loopcounter @ gt ) )
=> true )
& ( ~ ( n1 @ ( loopcounter @ gt ) )
=> true ) ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(86,plain,
~ ( true
=> ( ( ( n1 @ ( loopcounter @ gt ) )
=> true )
& ( ~ ( n1 @ ( loopcounter @ gt ) )
=> true ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(87,plain,
( ( ~ true
| ~ true )
& ( ( n1 @ ( loopcounter @ gt ) )
| ~ true )
& ( ~ true
| ~ ( n1 @ ( loopcounter @ gt ) ) )
& ( ( n1 @ ( loopcounter @ gt ) )
| ~ ( n1 @ ( loopcounter @ gt ) ) )
& true ),
inference(cnf,[status(esa)],[86]) ).
thf(92,plain,
( ~ true
| ~ true ),
inference(cnfConj,[status(thm)],[87]) ).
thf(93,plain,
~ true,
inference(simp,[status(thm)],[92]) ).
thf(88,plain,
true,
inference(cnfConj,[status(thm)],[87]) ).
thf(550,plain,
~ $true,
inference(rewrite,[status(thm)],[93,88]) ).
thf(551,plain,
$false,
inference(simp,[status(thm)],[550]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWV061+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04 % 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.06/10.33 % Computer : n012.cluster.edu
% 0.06/10.33 % Model : x86_64 x86_64
% 0.06/10.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/10.33 % Memory : 8046.5625MB
% 0.06/10.33 % OS : Linux 6.8.0-71-generic
% 0.06/10.33 % CPULimit : 300
% 0.06/10.33 % WCLimit : 300
% 0.06/10.33 % DateTime : Sat Sep 26 13:10:01 UTC 2026
% 0.06/10.33 % CPUTime :
% 0.06/10.34 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.10/10.62 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.10/10.74 % [INFO] Parsing done (116ms).
% 0.10/10.74 % [INFO] Running in sequential loop mode.
% 0.10/10.93 % [INFO] eprover registered as external prover.
% 0.10/10.93 % [INFO] Scanning for conjecture ...
% 0.10/10.99 % [INFO] Found a conjecture (or negated_conjecture) and 84 axioms. Running axiom selection ...
% 1.39/11.03 % [INFO] Axiom selection finished. Selected 83 axioms (removed 1 axioms).
% 1.39/11.11 % [INFO] Problem is first-order (TPTP FOF).
% 1.67/11.12 % [INFO] Type checking passed.
% 1.67/11.12 % [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 ...
% 4.01/11.89 % [INFO] Killing All external provers ...
% 4.46/11.90 % Time passed: 1478ms (effective reasoning time: 1147ms)
% 4.46/11.90 % 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)>
% 4.46/11.90 % Axioms used in derivation (0):
% 4.46/11.90 % No. of inferences in proof: 9
% 4.46/11.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1478 ms resp. 1147 ms w/o parsing
% 4.46/11.91 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.46/11.91 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------