TSTP Solution File: NUM436+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n004.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 May 5 08:27:18 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 71 ( 14 unt; 0 def)
% Number of atoms : 186 ( 34 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 202 ( 87 ~; 75 |; 31 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 24 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f565,plain,
$false,
inference(avatar_sat_refutation,[],[f145,f407,f410,f441,f445,f503,f564]) ).
fof(f564,plain,
~ spl5_1,
inference(avatar_contradiction_clause,[],[f563]) ).
fof(f563,plain,
( $false
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f562,f91]) ).
fof(f91,plain,
aInteger0(xq),
inference(cnf_transformation,[],[f23]) ).
fof(f23,axiom,
( sz00 != xq
& aInteger0(xq)
& sz00 != xp
& aInteger0(xp)
& aInteger0(xb)
& aInteger0(xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__979) ).
fof(f562,plain,
( ~ aInteger0(xq)
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f561,f85]) ).
fof(f85,plain,
aInteger0(xm),
inference(cnf_transformation,[],[f25]) ).
fof(f25,axiom,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm)
& aInteger0(xm) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1032) ).
fof(f561,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xq)
| ~ spl5_1 ),
inference(resolution,[],[f559,f123]) ).
fof(f123,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( aInteger0(sdtasdt0(X0,X1))
| ~ aInteger0(X1)
| ~ aInteger0(X0) ),
inference(flattening,[],[f43]) ).
fof(f43,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(f559,plain,
( ~ aInteger0(sdtasdt0(xq,xm))
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f558]) ).
fof(f558,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xq,xm))
| ~ spl5_1 ),
inference(superposition,[],[f551,f98]) ).
fof(f98,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f26,axiom,
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm))
& sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,sdtasdt0(xq,xm)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1071) ).
fof(f551,plain,
( ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) )
| ~ spl5_1 ),
inference(subsumption_resolution,[],[f79,f140]) ).
fof(f140,plain,
( sP0
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f138,plain,
( spl5_1
<=> sP0 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f79,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0)
| ~ sP0 ),
inference(cnf_transformation,[],[f69]) ).
fof(f69,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X0)
| ~ aInteger0(X0) ) )
| ~ sP0 ),
inference(rectify,[],[f68]) ).
fof(f68,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) )
| ~ sP0 ),
inference(nnf_transformation,[],[f63]) ).
fof(f63,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) )
| ~ sP0 ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f503,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f502]) ).
fof(f502,plain,
( $false
| spl5_1 ),
inference(subsumption_resolution,[],[f501,f89]) ).
fof(f89,plain,
aInteger0(xp),
inference(cnf_transformation,[],[f23]) ).
fof(f501,plain,
( ~ aInteger0(xp)
| spl5_1 ),
inference(subsumption_resolution,[],[f500,f85]) ).
fof(f500,plain,
( ~ aInteger0(xm)
| ~ aInteger0(xp)
| spl5_1 ),
inference(resolution,[],[f499,f123]) ).
fof(f499,plain,
( ~ aInteger0(sdtasdt0(xp,xm))
| spl5_1 ),
inference(trivial_inequality_removal,[],[f497]) ).
fof(f497,plain,
( sdtpldt0(xa,smndt0(xb)) != sdtpldt0(xa,smndt0(xb))
| ~ aInteger0(sdtasdt0(xp,xm))
| spl5_1 ),
inference(superposition,[],[f330,f99]) ).
fof(f99,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,sdtasdt0(xp,xm)),
inference(cnf_transformation,[],[f26]) ).
fof(f330,plain,
( ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) )
| spl5_1 ),
inference(subsumption_resolution,[],[f82,f139]) ).
fof(f139,plain,
( ~ sP0
| spl5_1 ),
inference(avatar_component_clause,[],[f138]) ).
fof(f82,plain,
! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0)
| sP0 ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ) )
| sP0 ),
inference(definition_folding,[],[f31,f63]) ).
fof(f31,plain,
( ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
& ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
& ! [X0] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xq,X0)
| ~ aInteger0(X0) ) )
| ( ~ sdteqdtlpzmzozddtrp0(xa,xb,xp)
& ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
& ! [X1] :
( sdtpldt0(xa,smndt0(xb)) != sdtasdt0(xp,X1)
| ~ aInteger0(X1) ) ) ),
inference(ennf_transformation,[],[f29]) ).
fof(f29,plain,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X1] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X1)
& aInteger0(X1) ) ) ),
inference(rectify,[],[f28]) ).
fof(f28,negated_conjecture,
~ ( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0)
& aInteger0(X0) ) ) ),
inference(negated_conjecture,[],[f27]) ).
fof(f27,conjecture,
( ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
| aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,X0)
& aInteger0(X0) ) )
& ( sdteqdtlpzmzozddtrp0(xa,xb,xp)
| aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
| ? [X0] :
( sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xp,X0)
& aInteger0(X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f445,plain,
spl5_5,
inference(avatar_contradiction_clause,[],[f444]) ).
fof(f444,plain,
( $false
| spl5_5 ),
inference(subsumption_resolution,[],[f443,f89]) ).
fof(f443,plain,
( ~ aInteger0(xp)
| spl5_5 ),
inference(subsumption_resolution,[],[f442,f91]) ).
fof(f442,plain,
( ~ aInteger0(xq)
| ~ aInteger0(xp)
| spl5_5 ),
inference(resolution,[],[f436,f123]) ).
fof(f436,plain,
( ~ aInteger0(sdtasdt0(xp,xq))
| spl5_5 ),
inference(avatar_component_clause,[],[f434]) ).
fof(f434,plain,
( spl5_5
<=> aInteger0(sdtasdt0(xp,xq)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_5])]) ).
fof(f441,plain,
( ~ spl5_5
| spl5_6 ),
inference(avatar_split_clause,[],[f392,f438,f434]) ).
fof(f438,plain,
( spl5_6
<=> aInteger0(sdtpldt0(xa,smndt0(xb))) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_6])]) ).
fof(f392,plain,
( aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(subsumption_resolution,[],[f391,f85]) ).
fof(f391,plain,
( aInteger0(sdtpldt0(xa,smndt0(xb)))
| ~ aInteger0(xm)
| ~ aInteger0(sdtasdt0(xp,xq)) ),
inference(superposition,[],[f123,f86]) ).
fof(f86,plain,
sdtpldt0(xa,smndt0(xb)) = sdtasdt0(sdtasdt0(xp,xq),xm),
inference(cnf_transformation,[],[f25]) ).
fof(f410,plain,
spl5_3,
inference(avatar_contradiction_clause,[],[f409]) ).
fof(f409,plain,
( $false
| spl5_3 ),
inference(subsumption_resolution,[],[f408,f100]) ).
fof(f100,plain,
aInteger0(sz10),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
aInteger0(sz10),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntOne) ).
fof(f408,plain,
( ~ aInteger0(sz10)
| spl5_3 ),
inference(resolution,[],[f402,f102]) ).
fof(f102,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0] :
( aInteger0(smndt0(X0))
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( aInteger0(X0)
=> aInteger0(smndt0(X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mIntNeg) ).
fof(f402,plain,
( ~ aInteger0(smndt0(sz10))
| spl5_3 ),
inference(avatar_component_clause,[],[f400]) ).
fof(f400,plain,
( spl5_3
<=> aInteger0(smndt0(sz10)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f407,plain,
( ~ spl5_3
| ~ spl5_4
| spl5_1 ),
inference(avatar_split_clause,[],[f393,f138,f404,f400]) ).
fof(f404,plain,
( spl5_4
<=> sdtpldt0(xa,smndt0(xb)) = smndt0(xq) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f393,plain,
( sdtpldt0(xa,smndt0(xb)) != smndt0(xq)
| ~ aInteger0(smndt0(sz10))
| spl5_1 ),
inference(superposition,[],[f330,f372]) ).
fof(f372,plain,
smndt0(xq) = sdtasdt0(xq,smndt0(sz10)),
inference(resolution,[],[f112,f91]) ).
fof(f112,plain,
! [X0] :
( ~ aInteger0(X0)
| smndt0(X0) = sdtasdt0(X0,smndt0(sz10)) ),
inference(cnf_transformation,[],[f37]) ).
fof(f37,plain,
! [X0] :
( ( smndt0(X0) = sdtasdt0(X0,smndt0(sz10))
& smndt0(X0) = sdtasdt0(smndt0(sz10),X0) )
| ~ aInteger0(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( aInteger0(X0)
=> ( smndt0(X0) = sdtasdt0(X0,smndt0(sz10))
& smndt0(X0) = sdtasdt0(smndt0(sz10),X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mMulMinOne) ).
fof(f145,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f84,f142,f138]) ).
fof(f142,plain,
( spl5_2
<=> sdteqdtlpzmzozddtrp0(xa,xb,xq) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f84,plain,
( ~ sdteqdtlpzmzozddtrp0(xa,xb,xq)
| sP0 ),
inference(cnf_transformation,[],[f64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : NUM436+3 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 14:06:53 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % (10289)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.35 % (10292)WARNING: value z3 for option sas not known
% 0.13/0.35 % (10292)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.35 % (10290)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.35 % (10291)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.35 % (10293)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.35 % (10294)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.35 % (10295)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.35 % (10296)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.36 TRYING [1]
% 0.13/0.36 TRYING [1]
% 0.13/0.36 TRYING [2]
% 0.13/0.36 TRYING [2]
% 0.13/0.36 TRYING [3]
% 0.13/0.36 TRYING [3]
% 0.13/0.37 % (10292)First to succeed.
% 0.13/0.37 % (10292)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-10289"
% 0.13/0.37 % (10292)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (10292)------------------------------
% 0.13/0.37 % (10292)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.37 % (10292)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (10292)Memory used [KB]: 1019
% 0.13/0.37 % (10292)Time elapsed: 0.016 s
% 0.13/0.37 % (10292)Instructions burned: 32 (million)
% 0.13/0.37 % (10289)Success in time 0.032 s
%------------------------------------------------------------------------------