TSTP Solution File: ARI608_1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : ARI608_1 : TPTP v8.1.0. Released v5.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n011.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 : Tue Sep 6 17:02:16 EDT 2022
% Result : Theorem 0.10s 0.39s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 23
% Syntax : Number of formulae : 53 ( 18 unt; 4 typ; 0 def)
% Number of atoms : 140 ( 1 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 164 ( 76 ~; 52 |; 10 &)
% ( 22 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of FOOLs : 3 ( 3 fml; 0 var)
% Number arithmetic : 537 ( 135 atm; 172 fun; 170 num; 60 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 54 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
tff(a_type,type,
a: $int ).
tff(b_type,type,
b: $int ).
tff(c_type,type,
c: $int ).
tff(f_type,type,
f: $int > $int ).
tff(1,plain,
( $lesseq($sum($product(-1,b),a),0)
<=> $greatereq($sum(b,$product(-1,a)),0) ),
inference(rewrite,[status(thm)],]) ).
tff(2,plain,
$sum(a,$product(-1,b)) = $sum($product(-1,b),a),
inference(rewrite,[status(thm)],]) ).
tff(3,plain,
( $lesseq($sum(a,$product(-1,b)),0)
<=> $lesseq($sum($product(-1,b),a),0) ),
inference(monotonicity,[status(thm)],[2]) ).
tff(4,plain,
( $lesseq($sum(a,$product(-1,b)),0)
<=> $greatereq($sum(b,$product(-1,a)),0) ),
inference(transitivity,[status(thm)],[3,1]) ).
tff(5,plain,
( $lesseq(a,b)
<=> $lesseq($sum(a,$product(-1,b)),0) ),
inference(rewrite,[status(thm)],]) ).
tff(6,plain,
( $lesseq(a,b)
<=> $lesseq(a,b) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
( ~ ( ( ! [X: $int,Y: $int] :
( $lesseq(X,Y)
=> $lesseq(f(X),f(Y)) )
& $lesseq(a,b)
& $less(b,c) )
=> $lesseq(f(a),f(c)) )
<=> ~ ( ~ ( ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
& $lesseq(a,b)
& ~ $lesseq(c,b) )
| $lesseq(f(a),f(c)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(8,axiom,
~ ( ( ! [X: $int,Y: $int] :
( $lesseq(X,Y)
=> $lesseq(f(X),f(Y)) )
& $lesseq(a,b)
& $less(b,c) )
=> $lesseq(f(a),f(c)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f_mon_implies_trans) ).
tff(9,plain,
~ ( ~ ( ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
& $lesseq(a,b)
& ~ $lesseq(c,b) )
| $lesseq(f(a),f(c)) ),
inference(modus_ponens,[status(thm)],[8,7]) ).
tff(10,plain,
( ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
& $lesseq(a,b)
& ~ $lesseq(c,b) ),
inference(or_elim,[status(thm)],[9]) ).
tff(11,plain,
$lesseq(a,b),
inference(and_elim,[status(thm)],[10]) ).
tff(12,plain,
$lesseq(a,b),
inference(modus_ponens,[status(thm)],[11,6]) ).
tff(13,plain,
$lesseq($sum(a,$product(-1,b)),0),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
$greatereq($sum(b,$product(-1,a)),0),
inference(modus_ponens,[status(thm)],[13,4]) ).
tff(15,plain,
( ~ $lesseq($sum(c,$product(-1,b)),0)
<=> ~ $greatereq($sum(b,$product(-1,c)),0) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
( ~ $lesseq(c,b)
<=> ~ $lesseq($sum(c,$product(-1,b)),0) ),
inference(rewrite,[status(thm)],]) ).
tff(17,plain,
( ~ $lesseq(c,b)
<=> ~ $lesseq(c,b) ),
inference(rewrite,[status(thm)],]) ).
tff(18,plain,
~ $lesseq(c,b),
inference(and_elim,[status(thm)],[10]) ).
tff(19,plain,
~ $lesseq(c,b),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
~ $lesseq($sum(c,$product(-1,b)),0),
inference(modus_ponens,[status(thm)],[19,16]) ).
tff(21,plain,
~ $greatereq($sum(b,$product(-1,c)),0),
inference(modus_ponens,[status(thm)],[20,15]) ).
tff(22,plain,
( ~ $lesseq(f(a),f(c))
<=> ~ $lesseq($sum(f(a),$product(-1,f(c))),0) ),
inference(rewrite,[status(thm)],]) ).
tff(23,plain,
( ~ $lesseq(f(a),f(c))
<=> ~ $lesseq(f(a),f(c)) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
~ $lesseq(f(a),f(c)),
inference(or_elim,[status(thm)],[9]) ).
tff(25,plain,
~ $lesseq(f(a),f(c)),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
~ $lesseq($sum(f(a),$product(-1,f(c))),0),
inference(modus_ponens,[status(thm)],[25,22]) ).
tff(27,plain,
^ [X: $int,Y: $int] :
refl(
( ( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
<=> ( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ) )),
inference(bind,[status(th)],]) ).
tff(28,plain,
( ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
<=> ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ) ),
inference(quant_intro,[status(thm)],[27]) ).
tff(29,plain,
^ [X: $int,Y: $int] :
rewrite(
( ( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $lesseq($sum(f(X),$product(-1,f(Y))),0) )
<=> ( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ) )),
inference(bind,[status(th)],]) ).
tff(30,plain,
( ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $lesseq($sum(f(X),$product(-1,f(Y))),0) )
<=> ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ) ),
inference(quant_intro,[status(thm)],[29]) ).
tff(31,plain,
^ [X: $int,Y: $int] :
rewrite(
( ( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
<=> ( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $lesseq($sum(f(X),$product(-1,f(Y))),0) ) )),
inference(bind,[status(th)],]) ).
tff(32,plain,
( ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
<=> ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $lesseq($sum(f(X),$product(-1,f(Y))),0) ) ),
inference(quant_intro,[status(thm)],[31]) ).
tff(33,plain,
( ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) )
<=> ! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(34,plain,
! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) ),
inference(and_elim,[status(thm)],[10]) ).
tff(35,plain,
! [X: $int,Y: $int] :
( ~ $lesseq(X,Y)
| $lesseq(f(X),f(Y)) ),
inference(modus_ponens,[status(thm)],[34,33]) ).
tff(36,plain,
! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $lesseq($sum(f(X),$product(-1,f(Y))),0) ),
inference(modus_ponens,[status(thm)],[35,32]) ).
tff(37,plain,
! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ),
inference(modus_ponens,[status(thm)],[36,30]) ).
tff(38,plain,
! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ),
inference(skolemize,[status(sab)],[37]) ).
tff(39,plain,
! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) ),
inference(modus_ponens,[status(thm)],[38,28]) ).
tff(40,plain,
( ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) )
<=> ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) ) ),
inference(rewrite,[status(thm)],]) ).
tff(41,plain,
( ( ~ $lesseq($sum(a,$product(-1,c)),0)
| $greatereq($sum(f(c),$product(-1,f(a))),0) )
<=> ( ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) ) ),
inference(rewrite,[status(thm)],]) ).
tff(42,plain,
( ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $greatereq($sum(f(c),$product(-1,f(a))),0) )
<=> ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) ) ),
inference(monotonicity,[status(thm)],[41]) ).
tff(43,plain,
( ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $greatereq($sum(f(c),$product(-1,f(a))),0) )
<=> ( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) ) ),
inference(transitivity,[status(thm)],[42,40]) ).
tff(44,plain,
( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $greatereq($sum(f(c),$product(-1,f(a))),0) ),
inference(quant_inst,[status(thm)],]) ).
tff(45,plain,
( ~ ! [X: $int,Y: $int] :
( ~ $lesseq($sum(X,$product(-1,Y)),0)
| $greatereq($sum(f(Y),$product(-1,f(X))),0) )
| ~ $lesseq($sum(a,$product(-1,c)),0)
| $lesseq($sum(f(a),$product(-1,f(c))),0) ),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
~ $lesseq($sum(a,$product(-1,c)),0),
inference(unit_resolution,[status(thm)],[45,39,26]) ).
tff(47,plain,
( $lesseq($sum(a,$product(-1,c)),0)
| $greatereq($sum(a,$product(-1,c)),0) ),
inference(theory_lemma,[status(thm)],]) ).
tff(48,plain,
$greatereq($sum(a,$product(-1,c)),0),
inference(unit_resolution,[status(thm)],[47,46]) ).
tff(49,plain,
$false,
inference(theory_lemma,[status(thm)],[48,21,14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : ARI608_1 : TPTP v8.1.0. Released v5.1.0.
% 0.06/0.14 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.10/0.34 % Computer : n011.cluster.edu
% 0.10/0.34 % Model : x86_64 x86_64
% 0.10/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.34 % Memory : 8042.1875MB
% 0.10/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.34 % CPULimit : 300
% 0.10/0.34 % WCLimit : 300
% 0.10/0.34 % DateTime : Tue Aug 30 00:46:55 EDT 2022
% 0.10/0.34 % CPUTime :
% 0.10/0.35 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.10/0.35 Usage: tptp [options] [-file:]file
% 0.10/0.35 -h, -? prints this message.
% 0.10/0.35 -smt2 print SMT-LIB2 benchmark.
% 0.10/0.35 -m, -model generate model.
% 0.10/0.35 -p, -proof generate proof.
% 0.10/0.35 -c, -core generate unsat core of named formulas.
% 0.10/0.35 -st, -statistics display statistics.
% 0.10/0.35 -t:timeout set timeout (in second).
% 0.10/0.35 -smt2status display status in smt2 format instead of SZS.
% 0.10/0.35 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.10/0.35 -<param>:<value> configuration parameter and value.
% 0.10/0.35 -o:<output-file> file to place output in.
% 0.10/0.39 % SZS status Theorem
% 0.10/0.39 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------