%------------------------------------------------------------------------------
% File : Leo-III---1.8.0
% Problem : COM001_1 : TPTP v9.3.1. Released v5.0.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 : n008.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 06:57:49 AM UTC 2026
% Result : Theorem 3.67s 12.37s
% Output : Refutation 3.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 11
% Syntax : Number of formulae : 24 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 102 ( 2 ~; 0 |; 4 &; 88 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Number of types : 7 ( 6 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 22 ( 0 ^; 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(state_type,type,
state: $tType ).
thf(label_type,type,
label: $tType ).
thf(statement_type,type,
statement: $tType ).
thf(register_type,type,
register: $tType ).
thf(number_type,type,
number: $tType ).
thf(boolean_type,type,
boolean: $tType ).
thf(p3_decl,type,
p3: state ).
thf(p4_decl,type,
p4: state ).
thf(p5_decl,type,
p5: state ).
thf(p8_decl,type,
p8: state ).
thf(n_decl,type,
n: number ).
thf(register_j_decl,type,
register_j: register ).
thf(out_decl,type,
out: label ).
thf(loop_decl,type,
loop: label ).
thf(equal_function_decl,type,
equal_function: register > number > boolean ).
thf(goto_decl,type,
goto: label > statement ).
thf(ifthen_decl,type,
ifthen: boolean > state > statement ).
thf(follows_decl,type,
follows: state > state > $o ).
thf(succeeds_decl,type,
succeeds: state > state > $o ).
thf(labels_decl,type,
labels: label > state > $o ).
thf(has_decl,type,
has: state > statement > $o ).
thf(3,axiom,
! [A: state,B: state] :
( ( A @ ( B @ follows ) )
=> ( A @ ( B @ succeeds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).
thf(14,plain,
! [A: state,B: state] :
( ( A @ ( B @ follows ) )
=> ( A @ ( B @ succeeds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(6,axiom,
! [A: state,B: boolean,C: state] :
( ( A @ ( B @ ifthen ) @ ( C @ has ) )
=> ( C @ ( A @ succeeds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conditional_success) ).
thf(20,plain,
! [A: state,B: boolean,C: state] :
( ( A @ ( B @ ifthen ) @ ( C @ has ) )
=> ( C @ ( A @ succeeds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,conjecture,
p3 @ ( p3 @ succeeds ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
thf(2,negated_conjecture,
~ ( p3 @ ( p3 @ succeeds ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(13,plain,
~ ( p3 @ ( p3 @ succeeds ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [A: state,B: label,C: state] :
( ( ( A @ ( B @ labels ) )
& ( B @ goto @ ( C @ has ) ) )
=> ( C @ ( A @ succeeds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).
thf(18,plain,
! [A: state,B: label,C: state] :
( ( ( A @ ( B @ labels ) )
& ( B @ goto @ ( C @ has ) ) )
=> ( C @ ( A @ succeeds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(4,axiom,
! [A: state,B: state,C: state] :
( ( ( A @ ( B @ succeeds ) )
& ( B @ ( C @ succeeds ) ) )
=> ( A @ ( C @ succeeds ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).
thf(16,plain,
! [A: state,B: state,C: state] :
( ( ( A @ ( B @ succeeds ) )
& ( B @ ( C @ succeeds ) ) )
=> ( A @ ( C @ succeeds ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,axiom,
out @ goto @ ( p4 @ has ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_4) ).
thf(24,plain,
out @ goto @ ( p4 @ has ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(10,axiom,
p4 @ ( p5 @ follows ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_4_to_5) ).
thf(25,plain,
p4 @ ( p5 @ follows ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
p3 @ ( loop @ labels ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).
thf(22,plain,
p3 @ ( loop @ labels ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(12,axiom,
loop @ goto @ ( p8 @ has ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).
thf(27,plain,
loop @ goto @ ( p8 @ has ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(11,axiom,
p3 @ ( p8 @ follows ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_8) ).
thf(26,plain,
p3 @ ( p8 @ follows ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(8,axiom,
p4 @ ( n @ ( register_j @ equal_function ) @ ifthen ) @ ( p3 @ has ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_3) ).
thf(23,plain,
p4 @ ( n @ ( register_j @ equal_function ) @ ifthen ) @ ( p3 @ has ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(28,plain,
$false,
inference(e,[status(thm)],[14,20,13,18,16,24,25,22,27,26,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM001_1 : TPTP v9.3.1. Released v5.0.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.14/10.42 % Computer : n008.cluster.edu
% 0.14/10.42 % Model : x86_64 x86_64
% 0.14/10.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/10.42 % Memory : 8046.5625MB
% 0.14/10.42 % OS : Linux 6.8.0-71-generic
% 0.14/10.42 % CPULimit : 300
% 0.14/10.42 % WCLimit : 300
% 0.14/10.42 % DateTime : Sat Sep 26 23:19:36 UTC 2026
% 0.14/10.43 % CPUTime :
% 0.14/10.43 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.19/11.01 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.40/11.21 % [INFO] Parsing done (199ms).
% 1.40/11.23 % [INFO] Running in sequential loop mode.
% 2.10/11.64 % [INFO] eprover registered as external prover.
% 2.10/11.64 % [INFO] Scanning for conjecture ...
% 2.30/11.74 % [INFO] Found a conjecture (or negated_conjecture) and 10 axioms. Running axiom selection ...
% 2.30/11.78 % [INFO] Axiom selection finished. Selected 10 axioms (removed 0 axioms).
% 2.50/11.81 % [INFO] Problem is typed first-order (TPTP TFF).
% 2.50/11.82 % [INFO] Type checking passed.
% 2.50/11.82 % [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.67/12.36 % External prover 'e' found a proof!
% 3.67/12.36 % [INFO] Killing All external provers ...
% 3.67/12.36 % Time passed: 1792ms (effective reasoning time: 1130ms)
% 3.67/12.36 % 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)>
% 3.67/12.37 % Axioms used in derivation (10): state_4, state_8, label_state_3, state_3, goto_success, transitivity_of_success, conditional_success, direct_success, transition_3_to_8, transition_4_to_5
% 3.67/12.37 % No. of inferences in proof: 24
% 3.67/12.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1792 ms resp. 1130 ms w/o parsing
% 3.99/12.41 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.99/12.41 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------