TSTP Solution File: NUM565+3 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM565+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 : n005.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 : Tue Apr 30 14:33:52 EDT 2024
% Result : Theorem 0.16s 0.37s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 6 unt; 0 def)
% Number of atoms : 106 ( 35 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 120 ( 34 ~; 15 |; 58 &)
% ( 2 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 22 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f681,plain,
$false,
inference(trivial_inequality_removal,[],[f675]) ).
fof(f675,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,slcrc0),
inference(backward_demodulation,[],[f358,f669]) ).
fof(f669,plain,
slcrc0 = sK20,
inference(resolution,[],[f668,f351]) ).
fof(f351,plain,
aSet0(sK20),
inference(cnf_transformation,[],[f230]) ).
fof(f230,plain,
( sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK20)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(sK20,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(sK20)
& aSubsetOf0(sK20,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sK20) )
& aSet0(sK20) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20])],[f228,f229]) ).
fof(f229,plain,
( ? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,X0) )
& aSet0(X0) )
=> ( sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK20)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(sK20,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(sK20)
& aSubsetOf0(sK20,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,sK20) )
& aSet0(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f228,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X1] : ~ aElementOf0(X1,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X2] :
( aElementOf0(X2,xS)
| ~ aElementOf0(X2,X0) )
& aSet0(X0) ),
inference(rectify,[],[f94]) ).
fof(f94,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,X0) )
& aSet0(X0) ),
inference(flattening,[],[f93]) ).
fof(f93,plain,
? [X0] :
( sdtlpdtrp0(xc,X0) != sdtlpdtrp0(xc,slcrc0)
& ! [X2] : ~ aElementOf0(X2,slcrc0)
& aSet0(slcrc0)
& aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,X0) )
& aSet0(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,plain,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X2] : aElementOf0(X2,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(rectify,[],[f81]) ).
fof(f81,negated_conjecture,
~ ! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
inference(negated_conjecture,[],[f80]) ).
fof(f80,conjecture,
! [X0] :
( ( aElementOf0(X0,slbdtsldtrb0(xS,sz00))
& sz00 = sbrdtbr0(X0)
& aSubsetOf0(X0,xS)
& ! [X1] :
( aElementOf0(X1,X0)
=> aElementOf0(X1,xS) )
& aSet0(X0) )
=> ( ( ~ ? [X1] : aElementOf0(X1,slcrc0)
& aSet0(slcrc0) )
=> sdtlpdtrp0(xc,X0) = sdtlpdtrp0(xc,slcrc0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(f668,plain,
( ~ aSet0(sK20)
| slcrc0 = sK20 ),
inference(trivial_inequality_removal,[],[f666]) ).
fof(f666,plain,
( sz00 != sz00
| slcrc0 = sK20
| ~ aSet0(sK20) ),
inference(superposition,[],[f459,f354]) ).
fof(f354,plain,
sz00 = sbrdtbr0(sK20),
inference(cnf_transformation,[],[f230]) ).
fof(f459,plain,
! [X0] :
( sz00 != sbrdtbr0(X0)
| slcrc0 = X0
| ~ aSet0(X0) ),
inference(cnf_transformation,[],[f285]) ).
fof(f285,plain,
! [X0] :
( ( ( sz00 = sbrdtbr0(X0)
| slcrc0 != X0 )
& ( slcrc0 = X0
| sz00 != sbrdtbr0(X0) ) )
| ~ aSet0(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 )
| ~ aSet0(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( aSet0(X0)
=> ( sz00 = sbrdtbr0(X0)
<=> slcrc0 = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(f358,plain,
sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK20),
inference(cnf_transformation,[],[f230]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM565+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.11/0.33 % Computer : n005.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 00:05:41 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.34 % (20685)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.35 % (20688)WARNING: value z3 for option sas not known
% 0.16/0.35 % (20687)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.35 % (20686)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.35 % (20688)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.16/0.35 % (20690)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.16/0.35 % (20692)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.16/0.35 % (20691)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.16/0.35 % (20689)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.36 % (20691)First to succeed.
% 0.16/0.37 % (20688)Also succeeded, but the first one will report.
% 0.16/0.37 % (20691)Refutation found. Thanks to Tanya!
% 0.16/0.37 % SZS status Theorem for theBenchmark
% 0.16/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.37 % (20691)------------------------------
% 0.16/0.37 % (20691)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.16/0.37 % (20691)Termination reason: Refutation
% 0.16/0.37
% 0.16/0.37 % (20691)Memory used [KB]: 1289
% 0.16/0.37 % (20691)Time elapsed: 0.013 s
% 0.16/0.37 % (20691)Instructions burned: 23 (million)
% 0.16/0.37 % (20691)------------------------------
% 0.16/0.37 % (20691)------------------------------
% 0.16/0.37 % (20685)Success in time 0.03 s
%------------------------------------------------------------------------------