TSTP Solution File: SWV486+1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n018.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 12:16:03 EDT 2023
% Result : Theorem 3.26s 1.86s
% Output : Refutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 23
% Syntax : Number of formulae : 38 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 93 ( 25 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 269 ( 6 ~; 5 |; 32 &; 198 @)
% ( 3 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 0 ^; 56 !; 3 ?; 59 :)
% Comments :
%------------------------------------------------------------------------------
thf(int_leq_type,type,
int_leq: $i > $i > $o ).
thf(int_one_type,type,
int_one: $i ).
thf(int_less_type,type,
int_less: $i > $i > $o ).
thf(n_type,type,
n: $i ).
thf(a_type,type,
a: $i > $i > $i ).
thf(real_zero_type,type,
real_zero: $i ).
thf(int_zero_type,type,
int_zero: $i ).
thf(plus_type,type,
plus: $i > $i > $i ).
thf(real_one_type,type,
real_one: $i ).
thf(qr_type,type,
qr: $i > $i > $i ).
thf(9,axiom,
! [A: $i] :
( ( plus @ A @ int_zero )
= A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_zero) ).
thf(42,plain,
! [A: $i] :
( ( plus @ A @ int_zero )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(13,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants) ).
thf(60,plain,
real_zero != real_one,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(8,axiom,
! [A: $i,B: $i] :
( ( plus @ A @ B )
= ( plus @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_commutative) ).
thf(39,plain,
! [A: $i,B: $i] :
( ( plus @ A @ B )
= ( plus @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(14,axiom,
! [A: $i,B: $i] :
( ( ( int_leq @ int_one @ A )
& ( int_leq @ A @ n )
& ( int_leq @ int_one @ B )
& ( int_leq @ B @ n ) )
=> ( ! [C: $i] :
( ( ( int_less @ int_zero @ C )
& ( A
= ( plus @ B @ C ) ) )
=> ! [D: $i] :
( ( ( int_leq @ int_one @ D )
& ( int_leq @ D @ B ) )
=> ( ( a @ ( plus @ D @ C ) @ D )
= ( qr @ ( plus @ D @ C ) @ D ) ) ) )
& ! [C: $i] :
( ( ( int_less @ int_zero @ C )
& ( B
= ( plus @ A @ C ) ) )
=> ! [D: $i] :
( ( ( int_leq @ int_one @ D )
& ( int_leq @ D @ A ) )
=> ( ( a @ D @ ( plus @ D @ C ) )
= real_zero ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qih) ).
thf(63,plain,
! [A: $i,B: $i] :
( ( ( int_leq @ int_one @ A )
& ( int_leq @ A @ n )
& ( int_leq @ int_one @ B )
& ( int_leq @ B @ n ) )
=> ( ! [C: $i] :
( ( ( int_less @ int_zero @ C )
& ( A
= ( plus @ B @ C ) ) )
=> ! [D: $i] :
( ( ( int_leq @ int_one @ D )
& ( int_leq @ D @ B ) )
=> ( ( a @ ( plus @ D @ C ) @ D )
= ( qr @ ( plus @ D @ C ) @ D ) ) ) )
& ! [C: $i] :
( ( ( int_less @ int_zero @ C )
& ( B
= ( plus @ A @ C ) ) )
=> ! [D: $i] :
( ( ( int_leq @ int_one @ D )
& ( int_leq @ D @ A ) )
=> ( ( a @ D @ ( plus @ D @ C ) )
= real_zero ) ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(12,axiom,
! [A: $i] :
( ( int_less @ int_zero @ A )
<=> ( int_leq @ int_one @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',one_successor_of_zero) ).
thf(55,plain,
! [A: $i] :
( ( ( int_less @ int_zero @ A )
=> ( int_leq @ int_one @ A ) )
& ( ( int_leq @ int_one @ A )
=> ( int_less @ int_zero @ A ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(7,axiom,
int_less @ int_zero @ int_one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_zero_one) ).
thf(38,plain,
int_less @ int_zero @ int_one,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(3,axiom,
! [A: $i,B: $i] :
( ( int_leq @ A @ B )
<=> ( ( int_less @ A @ B )
| ( A = B ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
thf(21,plain,
! [A: $i,B: $i] :
( ( ( int_leq @ A @ B )
=> ( ( int_less @ A @ B )
| ( A = B ) ) )
& ( ( ( int_less @ A @ B )
| ( A = B ) )
=> ( int_leq @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(5,axiom,
! [A: $i,B: $i] :
( ( int_less @ A @ B )
=> ( A != B ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_irreflexive) ).
thf(32,plain,
! [A: $i,B: $i] :
( ( int_less @ A @ B )
=> ( A != B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(10,axiom,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( int_less @ A @ B )
& ( int_leq @ C @ D ) )
=> ( int_leq @ ( plus @ A @ C ) @ ( plus @ B @ D ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_order1) ).
thf(45,plain,
! [A: $i,B: $i,C: $i,D: $i] :
( ( ( int_less @ A @ B )
& ( int_leq @ C @ D ) )
=> ( int_leq @ ( plus @ A @ C ) @ ( plus @ B @ D ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(6,axiom,
! [A: $i,B: $i] :
( ( int_less @ A @ B )
| ( int_leq @ B @ A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_total) ).
thf(36,plain,
! [A: $i,B: $i] :
( ( int_less @ A @ B )
| ( int_leq @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(4,axiom,
! [A: $i,B: $i,C: $i] :
( ( ( int_less @ A @ B )
& ( int_less @ B @ C ) )
=> ( int_less @ A @ C ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_less_transitive) ).
thf(30,plain,
! [A: $i,B: $i,C: $i] :
( ( ( int_less @ A @ B )
& ( int_less @ B @ C ) )
=> ( int_less @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(11,axiom,
! [A: $i,B: $i] :
( ( int_less @ A @ B )
<=> ? [C: $i] :
( ( ( plus @ A @ C )
= B )
& ( int_less @ int_zero @ C ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus_and_inverse) ).
thf(47,plain,
! [A: $i,B: $i] :
( ( ( int_less @ A @ B )
=> ? [C: $i] :
( ( ( plus @ A @ C )
= B )
& ( int_less @ int_zero @ C ) ) )
& ( ? [C: $i] :
( ( ( plus @ A @ C )
= B )
& ( int_less @ int_zero @ C ) )
=> ( int_less @ A @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(1,conjecture,
! [A: $i,B: $i] :
( ( ( int_leq @ int_one @ A )
& ( int_less @ A @ B )
& ( int_leq @ B @ n ) )
=> ( ( a @ A @ B )
= real_zero ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lt) ).
thf(2,negated_conjecture,
~ ! [A: $i,B: $i] :
( ( ( int_leq @ int_one @ A )
& ( int_less @ A @ B )
& ( int_leq @ B @ n ) )
=> ( ( a @ A @ B )
= real_zero ) ),
inference(neg_conjecture,[status(cth)],[1]) ).
thf(15,plain,
~ ! [A: $i,B: $i] :
( ( ( int_leq @ int_one @ A )
& ( int_less @ A @ B )
& ( int_leq @ B @ n ) )
=> ( ( a @ A @ B )
= real_zero ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(70,plain,
$false,
inference(e,[status(thm)],[42,60,39,63,55,38,21,32,45,36,30,47,15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV486+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.16 % Command : run_Leo-III %s %d
% 0.16/0.37 % Computer : n018.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 19 02:23:29 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.97/0.90 % [INFO] Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ...
% 1.41/1.04 % [INFO] Parsing done (135ms).
% 1.41/1.05 % [INFO] Running in sequential loop mode.
% 1.78/1.25 % [INFO] eprover registered as external prover.
% 1.78/1.26 % [INFO] cvc4 registered as external prover.
% 1.78/1.26 % [INFO] Scanning for conjecture ...
% 1.98/1.32 % [INFO] Found a conjecture and 12 axioms. Running axiom selection ...
% 1.98/1.35 % [INFO] Axiom selection finished. Selected 12 axioms (removed 0 axioms).
% 2.17/1.37 % [INFO] Problem is first-order (TPTP FOF).
% 2.17/1.38 % [INFO] Type checking passed.
% 2.17/1.38 % [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.26/1.85 % External prover 'e' found a proof!
% 3.26/1.85 % [INFO] Killing All external provers ...
% 3.26/1.85 % Time passed: 1319ms (effective reasoning time: 803ms)
% 3.26/1.85 % 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.26/1.85 % Axioms used in derivation (12): plus_and_order1, int_less_total, qih, int_leq, int_less_transitive, int_zero_one, plus_and_inverse, int_less_irreflexive, plus_commutative, real_constants, plus_zero, one_successor_of_zero
% 3.26/1.85 % No. of inferences in proof: 28
% 3.26/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1319 ms resp. 803 ms w/o parsing
% 3.26/1.90 % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.26/1.90 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------