TSTP Solution File: ROB015-10 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : ROB015-10 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n031.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 11:49:57 EDT 2023
% Result : Unsatisfiable 2.88s 1.68s
% Output : Refutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 34
% Syntax : Number of formulae : 53 ( 37 unt; 16 typ; 0 def)
% Number of atoms : 37 ( 36 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 290 ( 2 ~; 0 |; 0 &; 288 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 8 con; 0-4 aty)
% Number of variables : 60 ( 0 ^; 60 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(ifeq3_type,type,
ifeq3: $i > $i > $i > $i > $i ).
thf(negate_type,type,
negate: $i > $i ).
thf(add_type,type,
add: $i > $i > $i ).
thf(e_type,type,
e: $i ).
thf(multiply_type,type,
multiply: $i > $i > $i ).
thf(successor_type,type,
successor: $i > $i ).
thf(k_type,type,
k: $i ).
thf(d_type,type,
d: $i ).
thf(a_type,type,
a: $i ).
thf(b_type,type,
b: $i ).
thf(positive_integer_type,type,
positive_integer: $i > $i ).
thf(one_type,type,
one: $i ).
thf(true_type,type,
true: $i ).
thf(ifeq4_type,type,
ifeq4: $i > $i > $i > $i > $i ).
thf(ifeq_type,type,
ifeq: $i > $i > $i > $i > $i ).
thf(ifeq2_type,type,
ifeq2: $i > $i > $i > $i > $i ).
thf(17,axiom,
! [A: $i] :
( ( ifeq @ ( positive_integer @ A ) @ true @ ( positive_integer @ ( successor @ A ) ) @ true )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',next_integer) ).
thf(52,plain,
! [A: $i] :
( ( ifeq @ ( positive_integer @ A ) @ true @ ( positive_integer @ ( successor @ A ) ) @ true )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(13,axiom,
! [A: $i] :
( ( multiply @ one @ A )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_times_x) ).
thf(44,plain,
! [A: $i] :
( ( multiply @ one @ A )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(18,axiom,
! [C: $i,B: $i,A: $i] :
( ( add @ ( add @ A @ B ) @ C )
= ( add @ A @ ( add @ B @ C ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_add) ).
thf(54,plain,
! [C: $i,B: $i,A: $i] :
( ( add @ ( add @ A @ B ) @ C )
= ( add @ A @ ( add @ B @ C ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(15,axiom,
( ( ifeq3 @ ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) ) @ ( negate @ e ) @ a @ b )
= b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',base_step) ).
thf(48,plain,
( ( ifeq3 @ ( negate @ ( add @ e @ ( multiply @ k @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) ) @ ( negate @ e ) @ a @ b )
= b ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(16,axiom,
! [B: $i,A: $i] :
( ( add @ A @ B )
= ( add @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_add) ).
thf(50,plain,
! [B: $i,A: $i] :
( ( add @ A @ B )
= ( add @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(12,axiom,
( ( negate @ ( add @ ( negate @ e ) @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) )
= d ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condition) ).
thf(42,plain,
( ( negate @ ( add @ ( negate @ e ) @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) )
= d ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(3,axiom,
( ( positive_integer @ one )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one) ).
thf(24,plain,
( ( positive_integer @ one )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(2,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
thf(20,plain,
a != b,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(14,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq4 @ ( negate @ ( add @ A @ ( negate @ ( add @ B @ C ) ) ) ) @ ( negate @ ( add @ B @ ( negate @ ( add @ A @ C ) ) ) ) @ A @ B )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_2) ).
thf(46,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq4 @ ( negate @ ( add @ A @ ( negate @ ( add @ B @ C ) ) ) ) @ ( negate @ ( add @ B @ ( negate @ ( add @ A @ C ) ) ) ) @ A @ B )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(5,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ A @ A @ B @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_003) ).
thf(28,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq @ A @ A @ B @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(10,axiom,
! [B: $i,A: $i] :
( ( negate @ ( add @ ( negate @ ( add @ A @ B ) ) @ ( negate @ ( add @ A @ ( negate @ B ) ) ) ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',robbins_axiom) ).
thf(38,plain,
! [B: $i,A: $i] :
( ( negate @ ( add @ ( negate @ ( add @ A @ B ) ) @ ( negate @ ( add @ A @ ( negate @ B ) ) ) ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(7,axiom,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ifeq2 @ ( positive_integer @ A ) @ true @ ( ifeq4 @ ( negate @ ( add @ B @ ( negate @ C ) ) ) @ D @ ( negate @ ( add @ B @ ( negate @ ( add @ C @ ( multiply @ A @ ( add @ B @ D ) ) ) ) ) ) @ D ) @ D )
= D ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_3_4) ).
thf(32,plain,
! [D: $i,C: $i,B: $i,A: $i] :
( ( ifeq2 @ ( positive_integer @ A ) @ true @ ( ifeq4 @ ( negate @ ( add @ B @ ( negate @ C ) ) ) @ D @ ( negate @ ( add @ B @ ( negate @ ( add @ C @ ( multiply @ A @ ( add @ B @ D ) ) ) ) ) ) @ D ) @ D )
= D ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(8,axiom,
( ( positive_integer @ k )
= true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_positive) ).
thf(34,plain,
( ( positive_integer @ k )
= true ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(11,axiom,
! [B: $i,A: $i] :
( ( ifeq2 @ ( positive_integer @ A ) @ true @ ( add @ A @ ( multiply @ B @ A ) ) @ ( multiply @ ( successor @ B ) @ A ) )
= ( multiply @ ( successor @ B ) @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',times_by_adding) ).
thf(40,plain,
! [B: $i,A: $i] :
( ( ifeq2 @ ( positive_integer @ A ) @ true @ ( add @ A @ ( multiply @ B @ A ) ) @ ( multiply @ ( successor @ B ) @ A ) )
= ( multiply @ ( successor @ B ) @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(4,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq4 @ A @ A @ B @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
thf(26,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq4 @ A @ A @ B @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(9,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq3 @ A @ A @ B @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_001) ).
thf(36,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq3 @ A @ A @ B @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(6,axiom,
! [C: $i,B: $i,A: $i] :
( ( ifeq2 @ A @ A @ B @ C )
= B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom_002) ).
thf(30,plain,
! [C: $i,B: $i,A: $i] :
( ( ifeq2 @ A @ A @ B @ C )
= B ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(1,negated_conjecture,
( ( ifeq3 @ ( negate @ ( add @ e @ ( multiply @ ( successor @ k ) @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) ) @ ( negate @ e ) @ a @ b )
= b ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_induction_step) ).
thf(19,plain,
( ( ifeq3 @ ( negate @ ( add @ e @ ( multiply @ ( successor @ k ) @ ( add @ d @ ( negate @ ( add @ d @ ( negate @ e ) ) ) ) ) ) ) @ ( negate @ e ) @ a @ b )
= b ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(64,plain,
$false,
inference(cvc4,[status(thm)],[52,44,54,48,50,42,24,20,46,28,38,32,34,40,26,36,30,19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ROB015-10 : TPTP v8.1.2. Released v7.5.0.
% 0.11/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n031.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 19 00:06:27 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.89/0.84 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.19/0.95 % [INFO] Parsing done (111ms).
% 1.19/0.96 % [INFO] Running in sequential loop mode.
% 1.51/1.14 % [INFO] eprover registered as external prover.
% 1.51/1.14 % [INFO] cvc4 registered as external prover.
% 1.51/1.15 % [INFO] Scanning for conjecture ...
% 1.77/1.20 % [INFO] Found a conjecture and 16 axioms. Running axiom selection ...
% 1.88/1.24 % [INFO] Axiom selection finished. Selected 16 axioms (removed 0 axioms).
% 1.88/1.26 % [INFO] Problem is propositional (TPTP CNF).
% 1.88/1.26 % [INFO] Type checking passed.
% 1.88/1.27 % [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.88/1.68 % External prover 'cvc4' found a proof!
% 2.88/1.68 % [INFO] Killing All external provers ...
% 2.88/1.68 % Time passed: 1163ms (effective reasoning time: 717ms)
% 2.88/1.68 % 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.88/1.68 % Axioms used in derivation (16): k_positive, ifeq_axiom, next_integer, times_by_adding, condition, ifeq_axiom_003, lemma_3_4, ifeq_axiom_002, one, ifeq_axiom_001, one_times_x, lemma_3_2, associativity_of_add, commutativity_of_add, base_step, robbins_axiom
% 2.88/1.68 % No. of inferences in proof: 37
% 2.88/1.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1163 ms resp. 717 ms w/o parsing
% 3.24/1.72 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.24/1.72 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------