TSTP Solution File: NUM472+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM472+1 : 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_sat --cores 0 -t %d %s
% Computer : n016.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 18:05:19 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 98 ( 13 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 113 ( 46 ~; 40 |; 18 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 40 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_6,type,
sQ3_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_7,type,
sQ4_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_8,type,
sQ5_eqProxy: ( $real * $real ) > $o ).
fof(f484,plain,
$false,
inference(subsumption_resolution,[],[f483,f246]) ).
fof(f246,plain,
aNaturalNumber0(xn),
inference(literal_reordering,[],[f140]) ).
fof(f140,plain,
aNaturalNumber0(xn),
inference(cnf_transformation,[],[f34]) ).
fof(f34,axiom,
( aNaturalNumber0(xn)
& aNaturalNumber0(xm)
& aNaturalNumber0(xl) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__1324) ).
fof(f483,plain,
~ aNaturalNumber0(xn),
inference(subsumption_resolution,[],[f474,f232]) ).
fof(f232,plain,
aNaturalNumber0(xm),
inference(literal_reordering,[],[f139]) ).
fof(f139,plain,
aNaturalNumber0(xm),
inference(cnf_transformation,[],[f34]) ).
fof(f474,plain,
( ~ aNaturalNumber0(xm)
| ~ aNaturalNumber0(xn) ),
inference(resolution,[],[f473,f261]) ).
fof(f261,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(literal_reordering,[],[f153]) ).
fof(f153,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(cnf_transformation,[],[f50]) ).
fof(f50,plain,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(flattening,[],[f40]) ).
fof(f40,negated_conjecture,
~ sdtlseqdt0(xm,sdtpldt0(xm,xn)),
inference(negated_conjecture,[],[f39]) ).
fof(f39,conjecture,
sdtlseqdt0(xm,sdtpldt0(xm,xn)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f473,plain,
! [X3,X1] :
( sdtlseqdt0(X1,sdtpldt0(X1,X3))
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1) ),
inference(subsumption_resolution,[],[f222,f226]) ).
fof(f226,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0)
| aNaturalNumber0(sdtpldt0(X1,X0)) ),
inference(literal_reordering,[],[f197]) ).
fof(f197,plain,
! [X0,X1] :
( aNaturalNumber0(sdtpldt0(X1,X0))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0,X1] :
( ~ aNaturalNumber0(X1)
| aNaturalNumber0(sdtpldt0(X1,X0))
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f108]) ).
fof(f108,plain,
! [X1,X0] :
( aNaturalNumber0(sdtpldt0(X1,X0))
| ~ aNaturalNumber0(X0)
| ~ aNaturalNumber0(X1) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,plain,
! [X1,X0] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X1,X0)) ),
inference(rectify,[],[f4]) ).
fof(f4,axiom,
! [X1,X0] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> aNaturalNumber0(sdtpldt0(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSortsB) ).
fof(f222,plain,
! [X3,X1] :
( ~ aNaturalNumber0(sdtpldt0(X1,X3))
| ~ aNaturalNumber0(X3)
| sdtlseqdt0(X1,sdtpldt0(X1,X3))
| ~ aNaturalNumber0(X1) ),
inference(literal_reordering,[],[f201]) ).
fof(f201,plain,
! [X3,X1] :
( ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X3)
| sdtlseqdt0(X1,sdtpldt0(X1,X3))
| ~ aNaturalNumber0(sdtpldt0(X1,X3)) ),
inference(equality_resolution,[],[f150]) ).
fof(f150,plain,
! [X3,X0,X1] :
( sdtlseqdt0(X1,X0)
| sdtpldt0(X1,X3) != X0
| ~ aNaturalNumber0(X3)
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0,X1] :
( ( ( ( sdtpldt0(X1,sK0(X0,X1)) = X0
& aNaturalNumber0(sK0(X0,X1)) )
| ~ sdtlseqdt0(X1,X0) )
& ( sdtlseqdt0(X1,X0)
| ! [X3] :
( sdtpldt0(X1,X3) != X0
| ~ aNaturalNumber0(X3) ) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f118,f119]) ).
fof(f119,plain,
! [X0,X1] :
( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
=> ( sdtpldt0(X1,sK0(X0,X1)) = X0
& aNaturalNumber0(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
! [X0,X1] :
( ( ( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
| ~ sdtlseqdt0(X1,X0) )
& ( sdtlseqdt0(X1,X0)
| ! [X3] :
( sdtpldt0(X1,X3) != X0
| ~ aNaturalNumber0(X3) ) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(rectify,[],[f117]) ).
fof(f117,plain,
! [X0,X1] :
( ( ( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
| ~ sdtlseqdt0(X1,X0) )
& ( sdtlseqdt0(X1,X0)
| ! [X2] :
( sdtpldt0(X1,X2) != X0
| ~ aNaturalNumber0(X2) ) ) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(nnf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1] :
( ( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
<=> sdtlseqdt0(X1,X0) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(flattening,[],[f67]) ).
fof(f67,plain,
! [X1,X0] :
( ( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
<=> sdtlseqdt0(X1,X0) )
| ~ aNaturalNumber0(X1)
| ~ aNaturalNumber0(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,plain,
! [X1,X0] :
( ( aNaturalNumber0(X1)
& aNaturalNumber0(X0) )
=> ( ? [X2] :
( sdtpldt0(X1,X2) = X0
& aNaturalNumber0(X2) )
<=> sdtlseqdt0(X1,X0) ) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X1,X0] :
( ( aNaturalNumber0(X0)
& aNaturalNumber0(X1) )
=> ( ? [X2] :
( aNaturalNumber0(X2)
& sdtpldt0(X0,X2) = X1 )
<=> sdtlseqdt0(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefLE) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM472+1 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 07:00:45 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.44 % (4881)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.44 % (4881)Instruction limit reached!
% 0.21/0.44 % (4881)------------------------------
% 0.21/0.44 % (4881)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.44 % (4881)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.44 % (4881)Termination reason: Unknown
% 0.21/0.44 % (4881)Termination phase: Blocked clause elimination
% 0.21/0.44
% 0.21/0.44 % (4881)Memory used [KB]: 1023
% 0.21/0.44 % (4881)Time elapsed: 0.003 s
% 0.21/0.44 % (4881)Instructions burned: 4 (million)
% 0.21/0.44 % (4881)------------------------------
% 0.21/0.44 % (4881)------------------------------
% 0.21/0.46 % (4873)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.21/0.47 TRYING [1]
% 0.21/0.47 TRYING [2]
% 0.21/0.48 TRYING [3]
% 0.21/0.48 % (4889)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.50 % (4899)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.50 % (4876)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.51 % (4874)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.51 % (4892)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.51 % (4880)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.51 % (4878)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.51 % (4890)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.21/0.52 % (4884)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.52 TRYING [4]
% 0.21/0.52 % (4899)First to succeed.
% 0.21/0.52 TRYING [1]
% 0.21/0.52 % (4874)Also succeeded, but the first one will report.
% 0.21/0.52 % (4899)Refutation found. Thanks to Tanya!
% 0.21/0.52 % SZS status Theorem for theBenchmark
% 0.21/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.52 % (4899)------------------------------
% 0.21/0.52 % (4899)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (4899)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (4899)Termination reason: Refutation
% 0.21/0.52
% 0.21/0.52 % (4899)Memory used [KB]: 5884
% 0.21/0.52 % (4899)Time elapsed: 0.013 s
% 0.21/0.52 % (4899)Instructions burned: 11 (million)
% 0.21/0.52 % (4899)------------------------------
% 0.21/0.52 % (4899)------------------------------
% 0.21/0.52 % (4869)Success in time 0.166 s
%------------------------------------------------------------------------------