TSTP Solution File: NUM318+1 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : NUM318+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n010.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 : Sun Sep 18 13:03:31 EDT 2022
% Result : Theorem 0.18s 0.43s
% Output : Proof 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 34 ( 10 unt; 8 typ; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 166 ( 73 ~; 57 |; 16 &)
% ( 17 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 15 ( 15 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 63 ( 54 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
tff(sum_type,type,
sum: ( $i * $i * $i ) > $o ).
tff(n0_type,type,
n0: $i ).
tff(nn5_type,type,
nn5: $i ).
tff(n5_type,type,
n5: $i ).
tff(rdn_translate_type,type,
rdn_translate: ( $i * $i ) > $o ).
tff(rdn_neg_type,type,
rdn_neg: $i > $i ).
tff(rdn_pos_type,type,
rdn_pos: $i > $i ).
tff(rdnn_type,type,
rdnn: $i > $i ).
tff(1,plain,
( ~ sum(n5,nn5,n0)
<=> ~ sum(n5,nn5,n0) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
~ sum(n5,nn5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_n5_nn5_n0) ).
tff(3,plain,
~ sum(n5,nn5,n0),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [POS_X: $i,NEG_X: $i,RDN_X: $i] :
refl(
( ( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
inference(bind,[status(th)],]) ).
tff(5,plain,
( ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
^ [POS_X: $i,NEG_X: $i,RDN_X: $i] :
trans(
monotonicity(
trans(
monotonicity(
rewrite(
( ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ~ ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ~ ~ ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
rewrite(
( ~ ~ ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
<=> ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
( ( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) )
<=> ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X))
| sum(POS_X,NEG_X,n0) ) )),
rewrite(
( ( ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X))
| sum(POS_X,NEG_X,n0) )
<=> ( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
( ( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) )
<=> ( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) )),
inference(bind,[status(th)],]) ).
tff(7,plain,
( ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) )
<=> ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ) ),
inference(quant_intro,[status(thm)],[6]) ).
tff(8,plain,
( ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) )
<=> ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ) ),
inference(rewrite,[status(thm)],]) ).
tff(9,plain,
^ [POS_X: $i,NEG_X: $i,RDN_X: $i] :
rewrite(
( ( ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
=> sum(POS_X,NEG_X,n0) )
<=> ( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ) )),
inference(bind,[status(th)],]) ).
tff(10,plain,
( ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
=> sum(POS_X,NEG_X,n0) )
<=> ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ) ),
inference(quant_intro,[status(thm)],[9]) ).
tff(11,axiom,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
=> sum(POS_X,NEG_X,n0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+2.ax',sum_entry_point_posx_negx) ).
tff(12,plain,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ),
inference(modus_ponens,[status(thm)],[11,10]) ).
tff(13,plain,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ),
inference(modus_ponens,[status(thm)],[12,8]) ).
tff(14,plain,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( ~ ( rdn_translate(POS_X,rdn_pos(RDN_X))
& rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(POS_X,NEG_X,n0) ),
inference(skolemize,[status(sab)],[13]) ).
tff(15,plain,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ),
inference(modus_ponens,[status(thm)],[14,7]) ).
tff(16,plain,
! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) ),
inference(modus_ponens,[status(thm)],[15,5]) ).
tff(17,plain,
( rdn_translate(nn5,rdn_neg(rdnn(n5)))
<=> rdn_translate(nn5,rdn_neg(rdnn(n5))) ),
inference(rewrite,[status(thm)],]) ).
tff(18,axiom,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn5) ).
tff(19,plain,
rdn_translate(nn5,rdn_neg(rdnn(n5))),
inference(modus_ponens,[status(thm)],[18,17]) ).
tff(20,plain,
( rdn_translate(n5,rdn_pos(rdnn(n5)))
<=> rdn_translate(n5,rdn_pos(rdnn(n5))) ),
inference(rewrite,[status(thm)],]) ).
tff(21,axiom,
rdn_translate(n5,rdn_pos(rdnn(n5))),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdn5) ).
tff(22,plain,
rdn_translate(n5,rdn_pos(rdnn(n5))),
inference(modus_ponens,[status(thm)],[21,20]) ).
tff(23,plain,
( ( ~ ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(n5,nn5,n0)
| ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
| ~ rdn_translate(nn5,rdn_neg(rdnn(n5))) )
<=> ( ~ ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(n5,nn5,n0)
| ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
| ~ rdn_translate(nn5,rdn_neg(rdnn(n5))) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,plain,
( ~ ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(n5,nn5,n0)
| ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
| ~ rdn_translate(nn5,rdn_neg(rdnn(n5))) ),
inference(quant_inst,[status(thm)],]) ).
tff(25,plain,
( ~ ! [POS_X: $i,NEG_X: $i,RDN_X: $i] :
( sum(POS_X,NEG_X,n0)
| ~ rdn_translate(POS_X,rdn_pos(RDN_X))
| ~ rdn_translate(NEG_X,rdn_neg(RDN_X)) )
| sum(n5,nn5,n0)
| ~ rdn_translate(n5,rdn_pos(rdnn(n5)))
| ~ rdn_translate(nn5,rdn_neg(rdnn(n5))) ),
inference(modus_ponens,[status(thm)],[24,23]) ).
tff(26,plain,
$false,
inference(unit_resolution,[status(thm)],[25,22,19,16,3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM318+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.11 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri Sep 2 09:18:58 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.33 Z3tptp [4.8.9.0] (c) 2006-20**. Microsoft Corp.
% 0.11/0.33 Usage: tptp [options] [-file:]file
% 0.11/0.33 -h, -? prints this message.
% 0.11/0.33 -smt2 print SMT-LIB2 benchmark.
% 0.11/0.33 -m, -model generate model.
% 0.11/0.33 -p, -proof generate proof.
% 0.11/0.33 -c, -core generate unsat core of named formulas.
% 0.11/0.33 -st, -statistics display statistics.
% 0.11/0.33 -t:timeout set timeout (in second).
% 0.11/0.33 -smt2status display status in smt2 format instead of SZS.
% 0.11/0.33 -check_status check the status produced by Z3 against annotation in benchmark.
% 0.11/0.33 -<param>:<value> configuration parameter and value.
% 0.11/0.33 -o:<output-file> file to place output in.
% 0.18/0.43 % SZS status Theorem
% 0.18/0.43 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------