TSTP Solution File: COM001-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n017.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 : Fri May 19 10:13:50 EDT 2023
% Result : Unsatisfiable 2.57s 1.51s
% Output : Refutation 2.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 26
% Syntax : Number of formulae : 38 ( 15 unt; 15 typ; 0 def)
% Number of atoms : 35 ( 0 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 112 ( 14 ~; 12 |; 0 &; 86 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 15 usr; 9 con; 0-2 aty)
% Number of variables : 22 ( 0 ^; 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
thf(succeeds_type,type,
succeeds: $i > $i > $o ).
thf(p3_type,type,
p3: $i ).
thf(follows_type,type,
follows: $i > $i > $o ).
thf(has_type,type,
has: $i > $i > $o ).
thf(goto_type,type,
goto: $i > $i ).
thf(labels_type,type,
labels: $i > $i > $o ).
thf(ifthen_type,type,
ifthen: $i > $i > $i ).
thf(loop_type,type,
loop: $i ).
thf(equal_function_type,type,
equal_function: $i > $i > $i ).
thf(register_j_type,type,
register_j: $i ).
thf(n_type,type,
n: $i ).
thf(p4_type,type,
p4: $i ).
thf(out_type,type,
out: $i ).
thf(p5_type,type,
p5: $i ).
thf(p8_type,type,
p8: $i ).
thf(2,axiom,
! [B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( follows @ A @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
thf(14,plain,
! [B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( follows @ A @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( has @ B @ ( ifthen @ C @ A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conditional_success) ).
thf(20,plain,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( has @ B @ ( ifthen @ C @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(1,negated_conjecture,
~ ( succeeds @ p3 @ p3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
thf(12,plain,
~ ( succeeds @ p3 @ p3 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( has @ B @ ( goto @ C ) )
| ~ ( labels @ C @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
thf(18,plain,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( has @ B @ ( goto @ C ) )
| ~ ( labels @ C @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(3,axiom,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( succeeds @ A @ C )
| ~ ( succeeds @ C @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
thf(16,plain,
! [C: $i,B: $i,A: $i] :
( ( succeeds @ A @ B )
| ~ ( succeeds @ A @ C )
| ~ ( succeeds @ C @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(8,axiom,
has @ p4 @ ( goto @ out ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_4) ).
thf(24,plain,
has @ p4 @ ( goto @ out ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(9,axiom,
follows @ p5 @ p4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_4_to_5) ).
thf(25,plain,
follows @ p5 @ p4,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
labels @ loop @ p3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
thf(22,plain,
labels @ loop @ p3,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(11,axiom,
has @ p8 @ ( goto @ loop ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
thf(27,plain,
has @ p8 @ ( goto @ loop ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(10,axiom,
follows @ p8 @ p3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_8) ).
thf(26,plain,
follows @ p8 @ p3,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
has @ p3 @ ( ifthen @ ( equal_function @ register_j @ n ) @ p4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_3) ).
thf(23,plain,
has @ p3 @ ( ifthen @ ( equal_function @ register_j @ n ) @ p4 ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(28,plain,
$false,
inference(e,[status(thm)],[14,20,12,18,16,24,25,22,27,26,23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COM001-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.15 % Command : run_Leo-III %s %d
% 0.14/0.35 % Computer : n017.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 19 02:43:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.83/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.20/0.95 % [INFO] Parsing done (111ms).
% 1.20/0.96 % [INFO] Running in sequential loop mode.
% 1.48/1.15 % [INFO] eprover registered as external prover.
% 1.48/1.15 % [INFO] cvc4 registered as external prover.
% 1.48/1.16 % [INFO] Scanning for conjecture ...
% 1.69/1.20 % [INFO] Found a conjecture and 10 axioms. Running axiom selection ...
% 1.75/1.22 % [INFO] Axiom selection finished. Selected 10 axioms (removed 0 axioms).
% 1.85/1.23 % [INFO] Problem is propositional (TPTP CNF).
% 1.85/1.23 % [INFO] Type checking passed.
% 1.85/1.24 % [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 ...
% 2.57/1.51 % External prover 'e' found a proof!
% 2.57/1.51 % [INFO] Killing All external provers ...
% 2.57/1.51 % Time passed: 988ms (effective reasoning time: 546ms)
% 2.57/1.51 % 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)>
% 2.57/1.51 % 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
% 2.57/1.51 % No. of inferences in proof: 23
% 2.57/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 988 ms resp. 546 ms w/o parsing
% 2.68/1.54 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.68/1.54 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------