TSTP Solution File: SWV005-1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n014.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 : Thu Sep 29 15:09:35 EDT 2022
% Result : Unsatisfiable 0.19s 0.38s
% Output : Proof 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 36 ( 10 unt; 7 typ; 0 def)
% Number of atoms : 213 ( 0 equ)
% Maximal formula atoms : 12 ( 7 avg)
% Number of connectives : 240 ( 85 ~; 129 |; 0 &)
% ( 26 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 29 ( 29 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 9 ( 7 usr; 2 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 25 ( 22 !; 0 ?; 25 :)
% Comments :
%------------------------------------------------------------------------------
tff(less_than_type,type,
less_than: ( $i * $i ) > $o ).
tff(n_type,type,
n: $i ).
tff(a_type,type,
a: $i > $i ).
tff(predecessor_type,type,
predecessor: $i > $i ).
tff(l_type,type,
l: $i ).
tff(one_type,type,
one: $i ).
tff(k_type,type,
k: $i ).
tff(1,plain,
^ [X: $i] :
refl(
( ( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
inference(bind,[status(th)],]) ).
tff(2,plain,
( ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) ),
inference(quant_intro,[status(thm)],[1]) ).
tff(3,plain,
( ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) ),
inference(rewrite,[status(thm)],]) ).
tff(4,plain,
^ [X: $i] :
trans(
monotonicity(
trans(
monotonicity(
iff_true(asserted(less_than(one,l)),
( less_than(one,l)
<=> $true )),
( ~ less_than(one,l)
<=> ~ $true )),
rewrite(
( ~ $true
<=> $false )),
( ~ less_than(one,l)
<=> $false )),
( ( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ( $false
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
rewrite(
( ( $false
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
( ( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [X: $i] :
( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
<=> ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
^ [X: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( less_than(X,l)
| less_than(n,X) )
<=> ( less_than(X,l)
| less_than(n,X) ) )),
( ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l) )
<=> ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l) ) )),
rewrite(
( ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l) )
<=> ( ~ less_than(one,l)
| less_than(X,l)
| less_than(n,X) ) )),
( ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l) )
<=> ( ~ less_than(one,l)
| less_than(X,l)
| less_than(n,X) ) )),
( ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l)
| ~ less_than(a(X),a(predecessor(l))) )
<=> ( ~ less_than(one,l)
| less_than(X,l)
| less_than(n,X)
| ~ less_than(a(X),a(predecessor(l))) ) )),
rewrite(
( ( ~ less_than(one,l)
| less_than(X,l)
| less_than(n,X)
| ~ less_than(a(X),a(predecessor(l))) )
<=> ( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
( ( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l)
| ~ less_than(a(X),a(predecessor(l))) )
<=> ( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) )),
inference(bind,[status(th)],]) ).
tff(7,plain,
( ! [X: $i] :
( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l)
| ~ less_than(a(X),a(predecessor(l))) )
<=> ! [X: $i] :
( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ) ),
inference(quant_intro,[status(thm)],[6]) ).
tff(8,axiom,
! [X: $i] :
( less_than(X,l)
| less_than(n,X)
| ~ less_than(one,l)
| ~ less_than(a(X),a(predecessor(l))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).
tff(9,plain,
! [X: $i] :
( ~ less_than(one,l)
| less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ),
inference(modus_ponens,[status(thm)],[8,7]) ).
tff(10,plain,
! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,plain,
! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ),
inference(modus_ponens,[status(thm)],[10,3]) ).
tff(12,plain,
! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) ),
inference(modus_ponens,[status(thm)],[12,2]) ).
tff(14,plain,
( less_than(a(k),a(predecessor(l)))
<=> less_than(a(k),a(predecessor(l))) ),
inference(rewrite,[status(thm)],]) ).
tff(15,axiom,
less_than(a(k),a(predecessor(l))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).
tff(16,plain,
less_than(a(k),a(predecessor(l))),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
( ~ less_than(k,l)
<=> ~ less_than(k,l) ),
inference(rewrite,[status(thm)],]) ).
tff(18,axiom,
~ less_than(k,l),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).
tff(19,plain,
~ less_than(k,l),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
( ~ less_than(n,k)
<=> ~ less_than(n,k) ),
inference(rewrite,[status(thm)],]) ).
tff(21,axiom,
~ less_than(n,k),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).
tff(22,plain,
~ less_than(n,k),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
( ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) )
<=> ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
( ( less_than(k,l)
| ~ less_than(a(k),a(predecessor(l)))
| less_than(n,k) )
<=> ( less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(25,plain,
( ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l)))
| less_than(n,k) )
<=> ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) ) ),
inference(monotonicity,[status(thm)],[24]) ).
tff(26,plain,
( ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l)))
| less_than(n,k) )
<=> ( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) ) ),
inference(transitivity,[status(thm)],[25,23]) ).
tff(27,plain,
( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l)))
| less_than(n,k) ),
inference(quant_inst,[status(thm)],]) ).
tff(28,plain,
( ~ ! [X: $i] :
( less_than(X,l)
| ~ less_than(a(X),a(predecessor(l)))
| less_than(n,X) )
| less_than(n,k)
| less_than(k,l)
| ~ less_than(a(k),a(predecessor(l))) ),
inference(modus_ponens,[status(thm)],[27,26]) ).
tff(29,plain,
$false,
inference(unit_resolution,[status(thm)],[28,22,19,16,13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Sep 4 00:57:15 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.12/0.34 Usage: tptp [options] [-file:]file
% 0.12/0.34 -h, -? prints this message.
% 0.12/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.12/0.34 -m, -model generate model.
% 0.12/0.34 -p, -proof generate proof.
% 0.12/0.34 -c, -core generate unsat core of named formulas.
% 0.12/0.34 -st, -statistics display statistics.
% 0.12/0.34 -t:timeout set timeout (in second).
% 0.12/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.12/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.12/0.34 -<param>:<value> configuration parameter and value.
% 0.12/0.34 -o:<output-file> file to place output in.
% 0.19/0.38 % SZS status Unsatisfiable
% 0.19/0.38 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------