TSTP Solution File: FLD067-4 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : FLD067-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n029.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 Sep 16 14:56:05 EDT 2022
% Result : Unsatisfiable 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 35
% Syntax : Number of formulae : 65 ( 17 unt; 8 typ; 0 def)
% Number of atoms : 293 ( 0 equ)
% Maximal formula atoms : 16 ( 5 avg)
% Number of connectives : 409 ( 191 ~; 187 |; 0 &)
% ( 31 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of FOOLs : 18 ( 18 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 173 ( 155 !; 0 ?; 173 :)
% Comments :
%------------------------------------------------------------------------------
tff(sum_type,type,
sum: ( $i * $i * $i ) > $o ).
tff(additive_identity_type,type,
additive_identity: $i ).
tff(additive_inverse_type,type,
additive_inverse: $i > $i ).
tff(a_type,type,
a: $i ).
tff(defined_type,type,
defined: $i > $o ).
tff(less_or_equal_type,type,
less_or_equal: ( $i * $i ) > $o ).
tff(u_type,type,
u: $i ).
tff(b_type,type,
b: $i ).
tff(1,plain,
( defined(a)
<=> defined(a) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
tff(3,plain,
defined(a),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [X: $i] :
refl(
( ( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
<=> ( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
<=> ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
<=> ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ) ),
inference(rewrite,[status(thm)],]) ).
tff(7,plain,
^ [X: $i] :
rewrite(
( ( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) )
<=> ( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ) )),
inference(bind,[status(th)],]) ).
tff(8,plain,
( ! [X: $i] :
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) )
<=> ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ) ),
inference(quant_intro,[status(thm)],[7]) ).
tff(9,axiom,
! [X: $i] :
( sum(additive_inverse(X),X,additive_identity)
| ~ defined(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_addition) ).
tff(10,plain,
! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ),
inference(modus_ponens,[status(thm)],[9,8]) ).
tff(11,plain,
! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ),
inference(modus_ponens,[status(thm)],[10,6]) ).
tff(12,plain,
! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ),
inference(skolemize,[status(sab)],[11]) ).
tff(13,plain,
! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ),
inference(modus_ponens,[status(thm)],[12,5]) ).
tff(14,plain,
( ( ~ ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
| ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) )
<=> ( ~ ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
| ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ) ),
inference(rewrite,[status(thm)],]) ).
tff(15,plain,
( ~ ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
| ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ),
inference(quant_inst,[status(thm)],]) ).
tff(16,plain,
( ~ ! [X: $i] :
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) )
| ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ),
inference(modus_ponens,[status(thm)],[15,14]) ).
tff(17,plain,
sum(additive_inverse(a),a,additive_identity),
inference(unit_resolution,[status(thm)],[16,13,3]) ).
tff(18,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(
( ( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
<=> ( ~ sum(X,Y,Z)
| sum(Y,X,Z) ) )),
inference(bind,[status(th)],]) ).
tff(19,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ) ),
inference(rewrite,[status(thm)],]) ).
tff(21,plain,
^ [Z: $i,Y: $i,X: $i] :
rewrite(
( ( sum(Y,X,Z)
| ~ sum(X,Y,Z) )
<=> ( ~ sum(X,Y,Z)
| sum(Y,X,Z) ) )),
inference(bind,[status(th)],]) ).
tff(22,plain,
( ! [Z: $i,Y: $i,X: $i] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,axiom,
! [Z: $i,Y: $i,X: $i] :
( sum(Y,X,Z)
| ~ sum(X,Y,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
tff(24,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
inference(modus_ponens,[status(thm)],[24,20]) ).
tff(26,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
inference(skolemize,[status(sab)],[25]) ).
tff(27,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
inference(modus_ponens,[status(thm)],[26,19]) ).
tff(28,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
| ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
| ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) ) ),
inference(rewrite,[status(thm)],]) ).
tff(29,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
| ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) ),
inference(quant_inst,[status(thm)],]) ).
tff(30,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) )
| ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) ),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,plain,
sum(a,additive_inverse(a),additive_identity),
inference(unit_resolution,[status(thm)],[30,27,17]) ).
tff(32,plain,
( ~ less_or_equal(additive_identity,u)
<=> ~ less_or_equal(additive_identity,u) ),
inference(rewrite,[status(thm)],]) ).
tff(33,axiom,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6) ).
tff(34,plain,
~ less_or_equal(additive_identity,u),
inference(modus_ponens,[status(thm)],[33,32]) ).
tff(35,plain,
( sum(b,additive_inverse(a),u)
<=> sum(b,additive_inverse(a),u) ),
inference(rewrite,[status(thm)],]) ).
tff(36,axiom,
sum(b,additive_inverse(a),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_5) ).
tff(37,plain,
sum(b,additive_inverse(a),u),
inference(modus_ponens,[status(thm)],[36,35]) ).
tff(38,plain,
( less_or_equal(a,b)
<=> less_or_equal(a,b) ),
inference(rewrite,[status(thm)],]) ).
tff(39,axiom,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
tff(40,plain,
less_or_equal(a,b),
inference(modus_ponens,[status(thm)],[39,38]) ).
tff(41,plain,
^ [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
refl(
( ( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
<=> ( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(42,plain,
( ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
<=> ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) ),
inference(quant_intro,[status(thm)],[41]) ).
tff(43,plain,
( ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
<=> ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) ),
inference(rewrite,[status(thm)],]) ).
tff(44,plain,
^ [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( less_or_equal(U,V)
| ~ less_or_equal(X,Y) )
<=> ( ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
( ( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U) )
<=> ( ~ less_or_equal(X,Y)
| less_or_equal(U,V)
| ~ sum(X,Z,U) ) )),
rewrite(
( ( ~ less_or_equal(X,Y)
| less_or_equal(U,V)
| ~ sum(X,Z,U) )
<=> ( ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
( ( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U) )
<=> ( ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
( ( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) )
<=> ( ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V)
| ~ sum(Y,Z,V) ) )),
rewrite(
( ( ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V)
| ~ sum(Y,Z,V) )
<=> ( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
( ( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) )
<=> ( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) )),
inference(bind,[status(th)],]) ).
tff(45,plain,
( ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) )
<=> ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ) ),
inference(quant_intro,[status(thm)],[44]) ).
tff(46,axiom,
! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( less_or_equal(U,V)
| ~ less_or_equal(X,Y)
| ~ sum(X,Z,U)
| ~ sum(Y,Z,V) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
tff(47,plain,
! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ),
inference(modus_ponens,[status(thm)],[46,45]) ).
tff(48,plain,
! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ),
inference(modus_ponens,[status(thm)],[47,43]) ).
tff(49,plain,
! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ),
inference(skolemize,[status(sab)],[48]) ).
tff(50,plain,
! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ),
inference(modus_ponens,[status(thm)],[49,42]) ).
tff(51,plain,
( ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) )
<=> ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) ) ),
inference(rewrite,[status(thm)],]) ).
tff(52,plain,
( ( ~ sum(b,additive_inverse(a),u)
| ~ sum(a,additive_inverse(a),additive_identity)
| ~ less_or_equal(a,b)
| less_or_equal(additive_identity,u) )
<=> ( less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) ) ),
inference(rewrite,[status(thm)],]) ).
tff(53,plain,
( ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| ~ sum(b,additive_inverse(a),u)
| ~ sum(a,additive_inverse(a),additive_identity)
| ~ less_or_equal(a,b)
| less_or_equal(additive_identity,u) )
<=> ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) ) ),
inference(monotonicity,[status(thm)],[52]) ).
tff(54,plain,
( ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| ~ sum(b,additive_inverse(a),u)
| ~ sum(a,additive_inverse(a),additive_identity)
| ~ less_or_equal(a,b)
| less_or_equal(additive_identity,u) )
<=> ( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) ) ),
inference(transitivity,[status(thm)],[53,51]) ).
tff(55,plain,
( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| ~ sum(b,additive_inverse(a),u)
| ~ sum(a,additive_inverse(a),additive_identity)
| ~ less_or_equal(a,b)
| less_or_equal(additive_identity,u) ),
inference(quant_inst,[status(thm)],]) ).
tff(56,plain,
( ~ ! [V: $i,Z: $i,Y: $i,U: $i,X: $i] :
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) )
| less_or_equal(additive_identity,u)
| ~ sum(b,additive_inverse(a),u)
| ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity) ),
inference(modus_ponens,[status(thm)],[55,54]) ).
tff(57,plain,
$false,
inference(unit_resolution,[status(thm)],[56,50,40,37,34,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD067-4 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Aug 31 03:32:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.34 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.13/0.34 Usage: tptp [options] [-file:]file
% 0.13/0.34 -h, -? prints this message.
% 0.13/0.34 -smt2 print SMT-LIB2 benchmark.
% 0.13/0.34 -m, -model generate model.
% 0.13/0.34 -p, -proof generate proof.
% 0.13/0.34 -c, -core generate unsat core of named formulas.
% 0.13/0.34 -st, -statistics display statistics.
% 0.13/0.34 -t:timeout set timeout (in second).
% 0.13/0.34 -smt2status display status in smt2 format instead of SZS.
% 0.13/0.34 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.13/0.34 -<param>:<value> configuration parameter and value.
% 0.13/0.34 -o:<output-file> file to place output in.
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------