TSTP Solution File: NUM427+3 by Z3---4.8.9.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Z3---4.8.9.0
% Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : z3_tptp -proof -model -t:%d -file:%s
% Computer : n002.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:09:38 EDT 2022
% Result : Theorem 0.21s 0.40s
% Output : Proof 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 27
% Syntax : Number of formulae : 56 ( 11 unt; 10 typ; 0 def)
% Number of atoms : 152 ( 46 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 186 ( 93 ~; 51 |; 22 &)
% ( 17 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of FOOLs : 13 ( 13 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 10 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 26 !; 14 ?; 45 :)
% Comments :
%------------------------------------------------------------------------------
tff(aInteger0_type,type,
aInteger0: $i > $o ).
tff(smndt0_type,type,
smndt0: $i > $i ).
tff(xn_type,type,
xn: $i ).
tff(sdtpldt0_type,type,
sdtpldt0: ( $i * $i ) > $i ).
tff(xb_type,type,
xb: $i ).
tff(xa_type,type,
xa: $i ).
tff(sdtasdt0_type,type,
sdtasdt0: ( $i * $i ) > $i ).
tff(xq_type,type,
xq: $i ).
tff(aDivisorOf0_type,type,
aDivisorOf0: ( $i * $i ) > $o ).
tff(sdteqdtlpzmzozddtrp0_type,type,
sdteqdtlpzmzozddtrp0: ( $i * $i * $i ) > $o ).
tff(1,plain,
( aInteger0(xn)
<=> aInteger0(xn) ),
inference(rewrite,[status(thm)],]) ).
tff(2,axiom,
( aInteger0(xn)
& ( sdtasdt0(xq,xn) = sdtpldt0(xa,smndt0(xb)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__747) ).
tff(3,plain,
aInteger0(xn),
inference(and_elim,[status(thm)],[2]) ).
tff(4,plain,
aInteger0(xn),
inference(modus_ponens,[status(thm)],[3,1]) ).
tff(5,plain,
^ [W0: $i] :
refl(
( ( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
<=> ( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ) )),
inference(bind,[status(th)],]) ).
tff(6,plain,
( ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
<=> ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ) ),
inference(quant_intro,[status(thm)],[5]) ).
tff(7,plain,
( ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
<=> ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ) ),
inference(rewrite,[status(thm)],]) ).
tff(8,plain,
^ [W0: $i] :
rewrite(
( ( aInteger0(W0)
=> aInteger0(smndt0(W0)) )
<=> ( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ) )),
inference(bind,[status(th)],]) ).
tff(9,plain,
( ! [W0: $i] :
( aInteger0(W0)
=> aInteger0(smndt0(W0)) )
<=> ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ) ),
inference(quant_intro,[status(thm)],[8]) ).
tff(10,axiom,
! [W0: $i] :
( aInteger0(W0)
=> aInteger0(smndt0(W0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mIntNeg) ).
tff(11,plain,
! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ),
inference(modus_ponens,[status(thm)],[10,9]) ).
tff(12,plain,
! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ),
inference(modus_ponens,[status(thm)],[11,7]) ).
tff(13,plain,
! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ),
inference(skolemize,[status(sab)],[12]) ).
tff(14,plain,
! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) ),
inference(modus_ponens,[status(thm)],[13,6]) ).
tff(15,plain,
( ( ~ ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
| aInteger0(smndt0(xn))
| ~ aInteger0(xn) )
<=> ( ~ ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
| aInteger0(smndt0(xn))
| ~ aInteger0(xn) ) ),
inference(rewrite,[status(thm)],]) ).
tff(16,plain,
( ~ ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
| aInteger0(smndt0(xn))
| ~ aInteger0(xn) ),
inference(quant_inst,[status(thm)],]) ).
tff(17,plain,
( ~ ! [W0: $i] :
( aInteger0(smndt0(W0))
| ~ aInteger0(W0) )
| aInteger0(smndt0(xn))
| ~ aInteger0(xn) ),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
aInteger0(smndt0(xn)),
inference(unit_resolution,[status(thm)],[17,14,4]) ).
tff(19,plain,
^ [W0: $i] :
refl(
( ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
<=> ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) )),
inference(bind,[status(th)],]) ).
tff(20,plain,
( ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
<=> ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) ),
inference(quant_intro,[status(thm)],[19]) ).
tff(21,plain,
^ [W0: $i] :
trans(
monotonicity(
rewrite(
( ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
<=> ~ ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) )),
( ~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
<=> ~ ~ ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) )),
rewrite(
( ~ ~ ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
<=> ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) )),
( ~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
<=> ( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) )),
inference(bind,[status(th)],]) ).
tff(22,plain,
( ! [W0: $i] :
~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
<=> ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,plain,
( ~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
<=> ~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(24,axiom,
~ ( ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa)))
| sdteqdtlpzmzozddtrp0(xb,xa,xq) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
tff(25,plain,
~ ( ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) )
| aDivisorOf0(xq,sdtpldt0(xb,smndt0(xa))) ),
inference(or_elim,[status(thm)],[24]) ).
tff(26,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(or_elim,[status(thm)],[25]) ).
tff(27,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[26,23]) ).
tff(28,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[27,23]) ).
tff(29,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[28,23]) ).
tff(30,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[29,23]) ).
tff(31,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[30,23]) ).
tff(32,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[31,23]) ).
tff(33,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[32,23]) ).
tff(34,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[33,23]) ).
tff(35,plain,
~ ? [W0: $i] :
( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[34,23]) ).
tff(36,plain,
^ [W0: $i] :
refl(
$oeq(
~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ))),
inference(bind,[status(th)],]) ).
tff(37,plain,
! [W0: $i] :
~ ( aInteger0(W0)
& ( sdtasdt0(xq,W0) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(nnf-neg,[status(sab)],[35,36]) ).
tff(38,plain,
! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[37,22]) ).
tff(39,plain,
! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[38,20]) ).
tff(40,plain,
( ( sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)) )
<=> ( sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)) ) ),
inference(rewrite,[status(thm)],]) ).
tff(41,axiom,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__767) ).
tff(42,plain,
sdtasdt0(xq,smndt0(xn)) = sdtpldt0(xb,smndt0(xa)),
inference(modus_ponens,[status(thm)],[41,40]) ).
tff(43,plain,
( ( ~ ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
| ~ aInteger0(smndt0(xn))
| ( sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)) ) )
<=> ( ~ ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
| ~ aInteger0(smndt0(xn))
| ( sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)) ) ) ),
inference(rewrite,[status(thm)],]) ).
tff(44,plain,
( ~ ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
| ~ aInteger0(smndt0(xn))
| ( sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)) ) ),
inference(quant_inst,[status(thm)],]) ).
tff(45,plain,
( ~ ! [W0: $i] :
( ~ aInteger0(W0)
| ( sdtasdt0(xq,W0) != sdtpldt0(xb,smndt0(xa)) ) )
| ~ aInteger0(smndt0(xn))
| ( sdtasdt0(xq,smndt0(xn)) != sdtpldt0(xb,smndt0(xa)) ) ),
inference(modus_ponens,[status(thm)],[44,43]) ).
tff(46,plain,
$false,
inference(unit_resolution,[status(thm)],[45,42,39,18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM427+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : z3_tptp -proof -model -t:%d -file:%s
% 0.13/0.34 % Computer : n002.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 : Fri Sep 2 10:33:01 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.21/0.40 % SZS status Theorem
% 0.21/0.40 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------