TSTP Solution File: NUM436+3 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM436+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %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 : Wed Aug 31 17:59:32 EDT 2022
% Result : Theorem 0.21s 0.59s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 106 ( 23 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 130 ( 56 ~; 44 |; 29 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 24 ( 18 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f461,plain,
$false,
inference(unit_resulting_resolution,[],[f106,f144,f460,f137]) ).
fof(f137,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X1,X0))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X1,X0))
| ~ aInteger0(X0)
| ~ aInteger0(X1) ),
inference(rectify,[],[f68]) ).
fof(f68,plain,
! [X1,X0] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( ( aInteger0(X1)
& aInteger0(X0) )
=> aInteger0(sdtasdt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntMult) ).
fof(f460,plain,
~ aInteger0(sdtasdt0(xp,xm)),
inference(subsumption_resolution,[],[f306,f351]) ).
fof(f351,plain,
sP0,
inference(subsumption_resolution,[],[f350,f105]) ).
fof(f105,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
( sz00 != xp
& sz00 != xq
& aInteger0(xa)
& aInteger0(xb)
& aInteger0(xp)
& aInteger0(xq) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(f350,plain,
( sP0
| ~ aInteger0(xq) ),
inference(subsumption_resolution,[],[f349,f144]) ).
fof(f349,plain,
( sP0
| ~ aInteger0(xm)
| ~ aInteger0(xq) ),
inference(resolution,[],[f347,f137]) ).
fof(f347,plain,
( ~ aInteger0(sdtasdt0(xq,xm))
| sP0 ),
inference(trivial_inequality_removal,[],[f345]) ).
fof(f345,plain,
( sP0
| sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xq,xm)) ),
inference(superposition,[],[f129,f121]) ).
fof(f121,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f26,axiom,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(f129,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0)
| sP0 ),
inference(cnf_transformation,[],[f73]) ).
fof(f73,plain,
( ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| sP0 ),
inference(definition_folding,[],[f59,f72]) ).
fof(f72,plain,
( ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X1) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f59,plain,
( ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xp) )
| ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X1) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,plain,
~ ( ( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( aInteger0(X0)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0) )
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X1] :
( aInteger0(X1)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X1) )
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| sdteqdtlpzmzozddtrp0(xa,xb,xq) ) ),
inference(rectify,[],[f28]) ).
fof(f28,negated_conjecture,
~ ( ( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( aInteger0(X0)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0) )
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X0] :
( aInteger0(X0)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0) )
| sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ) ),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
( ( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( aInteger0(X0)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0) )
| sdteqdtlpzmzozddtrp0(xa,xb,xp) )
& ( ? [X0] :
( aInteger0(X0)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0) )
| sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f306,plain,
( ~ sP0
| ~ aInteger0(sdtasdt0(xp,xm)) ),
inference(trivial_inequality_removal,[],[f302]) ).
fof(f302,plain,
( ~ sP0
| ~ aInteger0(sdtasdt0(xp,xm))
| sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb)) ),
inference(superposition,[],[f127,f120]) ).
fof(f120,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f127,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f85]) ).
fof(f85,plain,
( ( ! [X0] :
( ~ aInteger0(X0)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
| ~ sP0 ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
( ( ! [X1] :
( ~ aInteger0(X1)
| sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X1) )
& ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) )
| ~ sP0 ),
inference(nnf_transformation,[],[f72]) ).
fof(f144,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
( aInteger0(xm)
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(f106,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : NUM436+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 06:42:27 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.56 % (8718)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.56 % (8706)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.56 % (8726)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.21/0.57 % (8710)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.57 % (8725)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.57 % (8718)Instruction limit reached!
% 0.21/0.57 % (8718)------------------------------
% 0.21/0.57 % (8718)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (8718)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (8718)Termination reason: Unknown
% 0.21/0.57 % (8718)Termination phase: Saturation
% 0.21/0.57
% 0.21/0.57 % (8718)Memory used [KB]: 6012
% 0.21/0.57 % (8718)Time elapsed: 0.076 s
% 0.21/0.57 % (8718)Instructions burned: 7 (million)
% 0.21/0.57 % (8718)------------------------------
% 0.21/0.57 % (8718)------------------------------
% 0.21/0.57 % (8714)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.59 % (8714)Instruction limit reached!
% 0.21/0.59 % (8714)------------------------------
% 0.21/0.59 % (8714)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (8726)First to succeed.
% 0.21/0.59 % (8726)Refutation found. Thanks to Tanya!
% 0.21/0.59 % SZS status Theorem for theBenchmark
% 0.21/0.59 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.59 % (8726)------------------------------
% 0.21/0.59 % (8726)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.59 % (8726)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.59 % (8726)Termination reason: Refutation
% 0.21/0.59
% 0.21/0.59 % (8726)Memory used [KB]: 1791
% 0.21/0.59 % (8726)Time elapsed: 0.091 s
% 0.21/0.59 % (8726)Instructions burned: 17 (million)
% 0.21/0.59 % (8726)------------------------------
% 0.21/0.59 % (8726)------------------------------
% 0.21/0.59 % (8702)Success in time 0.231 s
%------------------------------------------------------------------------------