TSTP Solution File: NUM550+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : NUM550+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 : n012.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:46 EDT 2022
% Result : Theorem 1.30s 0.52s
% Output : Refutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 10 unt; 0 def)
% Number of atoms : 71 ( 35 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 75 ( 31 ~; 23 |; 15 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 24 ( 19 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f404,plain,
$false,
inference(subsumption_resolution,[],[f403,f400]) ).
fof(f400,plain,
sz00 != sbrdtbr0(xQ),
inference(backward_demodulation,[],[f310,f240]) ).
fof(f240,plain,
xk = sbrdtbr0(xQ),
inference(cnf_transformation,[],[f66]) ).
fof(f66,axiom,
( xk = sbrdtbr0(xQ)
& isFinite0(xQ)
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2291) ).
fof(f310,plain,
sz00 != xk,
inference(cnf_transformation,[],[f62]) ).
fof(f62,axiom,
( aSet0(xT)
& aSet0(xS)
& sz00 != xk ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2202_02) ).
fof(f403,plain,
sz00 = sbrdtbr0(xQ),
inference(subsumption_resolution,[],[f396,f387]) ).
fof(f387,plain,
aSet0(xQ),
inference(equality_resolution,[],[f369]) ).
fof(f369,plain,
! [X0] :
( aSet0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f313,f242]) ).
fof(f242,plain,
slcrc0 = xQ,
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
slcrc0 = xQ,
inference(flattening,[],[f68]) ).
fof(f68,negated_conjecture,
~ ( slcrc0 != xQ ),
inference(negated_conjecture,[],[f67]) ).
fof(f67,conjecture,
slcrc0 != xQ,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(f313,plain,
! [X0] :
( aSet0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f219]) ).
fof(f219,plain,
! [X0] :
( ( slcrc0 = X0
| aElementOf0(sK12(X0),X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f217,f218]) ).
fof(f218,plain,
! [X0] :
( ? [X1] : aElementOf0(X1,X0)
=> aElementOf0(sK12(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f217,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X2] : ~ aElementOf0(X2,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(rectify,[],[f216]) ).
fof(f216,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(flattening,[],[f215]) ).
fof(f215,plain,
! [X0] :
( ( slcrc0 = X0
| ? [X1] : aElementOf0(X1,X0)
| ~ aSet0(X0) )
& ( ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) )
| slcrc0 != X0 ) ),
inference(nnf_transformation,[],[f155]) ).
fof(f155,plain,
! [X0] :
( slcrc0 = X0
<=> ( ! [X1] : ~ aElementOf0(X1,X0)
& aSet0(X0) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ( ~ ? [X1] : aElementOf0(X1,X0)
& aSet0(X0) )
<=> slcrc0 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefEmp) ).
fof(f396,plain,
( ~ aSet0(xQ)
| sz00 = sbrdtbr0(xQ) ),
inference(equality_resolution,[],[f374]) ).
fof(f374,plain,
! [X0] :
( ~ aSet0(X0)
| sz00 = sbrdtbr0(X0)
| xQ != X0 ),
inference(definition_unfolding,[],[f353,f242]) ).
fof(f353,plain,
! [X0] :
( ~ aSet0(X0)
| sz00 = sbrdtbr0(X0)
| slcrc0 != X0 ),
inference(cnf_transformation,[],[f234]) ).
fof(f234,plain,
! [X0] :
( ~ aSet0(X0)
| ( ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) )
& ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 ) ) ),
inference(nnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ~ aSet0(X0)
| ( slcrc0 = X0
<=> sz00 = sbrdtbr0(X0) ) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( slcrc0 = X0
<=> sz00 = sbrdtbr0(X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mCardEmpty) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM550+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/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.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 06:59:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.48 % (21074)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.48 % (21058)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.49 % (21066)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.20/0.49 % (21059)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50 % (21059)Instruction limit reached!
% 0.20/0.50 % (21059)------------------------------
% 0.20/0.50 % (21059)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 TRYING [1]
% 0.20/0.50 % (21075)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.50 % (21074)First to succeed.
% 0.20/0.51 TRYING [2]
% 0.20/0.51 % (21059)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (21059)Termination reason: Unknown
% 0.20/0.51 % (21059)Termination phase: Saturation
% 0.20/0.51
% 0.20/0.51 % (21059)Memory used [KB]: 5628
% 0.20/0.51 % (21059)Time elapsed: 0.006 s
% 0.20/0.51 % (21059)Instructions burned: 7 (million)
% 0.20/0.51 % (21059)------------------------------
% 0.20/0.51 % (21059)------------------------------
% 0.20/0.52 % (21057)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)
% 1.30/0.52 % (21067)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 1.30/0.52 TRYING [3]
% 1.30/0.52 % (21068)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)
% 1.30/0.52 % (21074)Refutation found. Thanks to Tanya!
% 1.30/0.52 % SZS status Theorem for theBenchmark
% 1.30/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 1.30/0.52 % (21074)------------------------------
% 1.30/0.52 % (21074)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.30/0.52 % (21074)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.30/0.52 % (21074)Termination reason: Refutation
% 1.30/0.52
% 1.30/0.52 % (21074)Memory used [KB]: 1151
% 1.30/0.52 % (21074)Time elapsed: 0.099 s
% 1.30/0.52 % (21074)Instructions burned: 7 (million)
% 1.30/0.52 % (21074)------------------------------
% 1.30/0.52 % (21074)------------------------------
% 1.30/0.52 % (21051)Success in time 0.165 s
%------------------------------------------------------------------------------