TSTP Solution File: SWV005-1 by Leo-III---1.7.7
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Leo-III---1.7.7
% Problem : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d
% Computer : n008.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:13:32 EDT 2023
% Result : Unsatisfiable 3.05s 1.71s
% Output : Refutation 3.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 30
% Syntax : Number of formulae : 52 ( 23 unt; 9 typ; 0 def)
% Number of atoms : 79 ( 18 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 242 ( 42 ~; 36 |; 0 &; 164 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 50 ( 0 ^; 50 !; 0 ?; 50 :)
% Comments :
%------------------------------------------------------------------------------
thf(less_than_type,type,
less_than: $i > $i > $o ).
thf(n_type,type,
n: $i ).
thf(k_type,type,
k: $i ).
thf(l_type,type,
l: $i ).
thf(i_type,type,
i: $i ).
thf(one_type,type,
one: $i ).
thf(a_type,type,
a: $i > $i ).
thf(predecessor_type,type,
predecessor: $i > $i ).
thf(successor_type,type,
successor: $i > $i ).
thf(18,axiom,
! [A: $i] :
~ ( less_than @ A @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_not_less_than_x) ).
thf(56,plain,
! [A: $i] :
~ ( less_than @ A @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).
thf(8,negated_conjecture,
! [A: $i] :
( ( less_than @ A @ l )
| ( less_than @ n @ A )
| ~ ( less_than @ one @ l )
| ~ ( less_than @ ( a @ A ) @ ( a @ ( predecessor @ l ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
thf(29,plain,
! [A: $i] :
( ( less_than @ A @ l )
| ( less_than @ n @ A )
| ~ ( less_than @ one @ l )
| ~ ( less_than @ ( a @ A ) @ ( a @ ( predecessor @ l ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).
thf(20,axiom,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ( C != A )
| ~ ( less_than @ C @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_and_less_than_transitivity1) ).
thf(60,plain,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ( C != A )
| ~ ( less_than @ C @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).
thf(3,negated_conjecture,
~ ( less_than @ k @ i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).
thf(28,plain,
~ ( less_than @ k @ i ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).
thf(17,axiom,
! [B: $i,A: $i] :
( ( less_than @ A @ B )
| ( less_than @ B @ A )
| ( A = B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_related) ).
thf(53,plain,
! [B: $i,A: $i] :
( ( less_than @ A @ B )
| ( less_than @ B @ A )
| ( A = B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).
thf(12,axiom,
! [B: $i,A: $i] :
( ( A = B )
| ( ( predecessor @ A )
!= ( predecessor @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_defined_predecessor) ).
thf(41,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( predecessor @ A )
!= ( predecessor @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).
thf(14,axiom,
! [A: $i] : ( less_than @ ( predecessor @ A ) @ A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_less_than) ).
thf(49,plain,
! [A: $i] : ( less_than @ ( predecessor @ A ) @ A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).
thf(11,axiom,
! [A: $i] :
( ( successor @ ( predecessor @ A ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_predecessor) ).
thf(39,plain,
! [A: $i] :
( ( successor @ ( predecessor @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).
thf(15,axiom,
! [A: $i] : ( less_than @ A @ ( successor @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_than_successor) ).
thf(50,plain,
! [A: $i] : ( less_than @ A @ ( successor @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).
thf(19,axiom,
! [B: $i,A: $i] :
( ~ ( less_than @ A @ B )
| ~ ( less_than @ B @ A ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',anti_symmetry_of_less_than) ).
thf(58,plain,
! [B: $i,A: $i] :
( ~ ( less_than @ A @ B )
| ~ ( less_than @ B @ A ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).
thf(6,negated_conjecture,
less_than @ ( a @ k ) @ ( a @ ( predecessor @ l ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
thf(24,plain,
less_than @ ( a @ k ) @ ( a @ ( predecessor @ l ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).
thf(10,axiom,
! [A: $i] :
( ( predecessor @ ( successor @ A ) )
= A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',predecessor_successor) ).
thf(37,plain,
! [A: $i] :
( ( predecessor @ ( successor @ A ) )
= A ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).
thf(9,negated_conjecture,
! [A: $i] :
( ~ ( less_than @ one @ A )
| ~ ( less_than @ A @ l )
| ~ ( less_than @ ( a @ A ) @ ( a @ ( predecessor @ A ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).
thf(25,plain,
! [A: $i] :
( ~ ( less_than @ one @ A )
| ~ ( less_than @ A @ l )
| ~ ( less_than @ ( a @ A ) @ ( a @ ( predecessor @ A ) ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).
thf(13,axiom,
! [B: $i,A: $i] :
( ( A = B )
| ( ( successor @ A )
!= ( successor @ B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',well_defined_successor) ).
thf(45,plain,
! [B: $i,A: $i] :
( ( A = B )
| ( ( successor @ A )
!= ( successor @ B ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).
thf(21,axiom,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ( C != B )
| ~ ( less_than @ A @ C ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_and_less_than_transitivity2) ).
thf(64,plain,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ( C != B )
| ~ ( less_than @ A @ C ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).
thf(5,negated_conjecture,
less_than @ one @ l,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).
thf(22,plain,
less_than @ one @ l,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).
thf(7,negated_conjecture,
! [A: $i] :
( ( less_than @ A @ l )
| ~ ( less_than @ A @ ( successor @ n ) )
| ~ ( less_than @ ( a @ A ) @ ( a @ k ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).
thf(27,plain,
! [A: $i] :
( ( less_than @ A @ l )
| ~ ( less_than @ A @ ( successor @ n ) )
| ~ ( less_than @ ( a @ A ) @ ( a @ k ) ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).
thf(2,negated_conjecture,
~ ( less_than @ k @ l ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
thf(26,plain,
~ ( less_than @ k @ l ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).
thf(1,negated_conjecture,
~ ( less_than @ n @ k ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
thf(23,plain,
~ ( less_than @ n @ k ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).
thf(4,negated_conjecture,
less_than @ l @ n,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).
thf(30,plain,
less_than @ l @ n,
inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).
thf(16,axiom,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ~ ( less_than @ A @ C )
| ~ ( less_than @ C @ B ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_than) ).
thf(51,plain,
! [C: $i,B: $i,A: $i] :
( ( less_than @ A @ B )
| ~ ( less_than @ A @ C )
| ~ ( less_than @ C @ B ) ),
inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).
thf(72,plain,
$false,
inference(e,[status(thm)],[56,29,60,28,53,41,49,39,50,58,24,37,25,45,64,22,27,26,23,30,51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV005-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.15 % Command : run_Leo-III %s %d
% 0.15/0.36 % Computer : n008.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 02:55:55 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.90/0.90 % [INFO] Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 1.25/1.03 % [INFO] Parsing done (132ms).
% 1.25/1.04 % [INFO] Running in sequential loop mode.
% 1.75/1.24 % [INFO] eprover registered as external prover.
% 1.75/1.24 % [INFO] cvc4 registered as external prover.
% 1.75/1.24 % [INFO] Scanning for conjecture ...
% 1.89/1.31 % [INFO] Found a conjecture and 12 axioms. Running axiom selection ...
% 1.89/1.33 % [INFO] Axiom selection finished. Selected 12 axioms (removed 0 axioms).
% 1.89/1.34 % [INFO] Problem is propositional (TPTP CNF).
% 1.89/1.35 % [INFO] Type checking passed.
% 1.89/1.35 % [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.05/1.71 % External prover 'e' found a proof!
% 3.05/1.71 % [INFO] Killing All external provers ...
% 3.05/1.71 % Time passed: 1175ms (effective reasoning time: 665ms)
% 3.05/1.71 % 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.05/1.71 % Axioms used in derivation (12): well_defined_successor, all_related, predecessor_successor, predecessor_less_than, well_defined_predecessor, less_than_successor, x_not_less_than_x, successor_predecessor, anti_symmetry_of_less_than, equal_and_less_than_transitivity1, equal_and_less_than_transitivity2, transitivity_of_less_than
% 3.05/1.71 % No. of inferences in proof: 43
% 3.05/1.71 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1175 ms resp. 665 ms w/o parsing
% 3.29/1.79 % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.29/1.79 % [INFO] Killing All external provers ...
%------------------------------------------------------------------------------