TSTP Solution File: NUM739_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM739_8 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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 May 1 03:33:54 EDT 2024
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 16
% Syntax : Number of formulae : 45 ( 14 unt; 8 typ; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 76 ( 35 ~; 24 |; 1 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 52 ( 52 !; 0 ?; 49 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
frac: $tType ).
tff(func_def_0,type,
x: frac ).
tff(func_def_1,type,
y: frac ).
tff(func_def_2,type,
z: frac ).
tff(func_def_3,type,
u: frac ).
tff(pred_def_1,type,
moref: ( frac * frac ) > $o ).
tff(pred_def_2,type,
eq: ( frac * frac ) > $o ).
tff(pred_def_3,type,
sP0: ( frac * frac ) > $o ).
tff(f51,plain,
$false,
inference(subsumption_resolution,[],[f48,f42]) ).
tff(f42,plain,
~ eq(y,x),
inference(unit_resulting_resolution,[],[f29,f38,f28]) ).
tff(f28,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ eq(X1,X2)
| ~ eq(X0,X1)
| eq(X0,X2) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X2)
| ~ eq(X1,X2)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: frac,X1: frac,X2: frac] :
( eq(X0,X1)
=> ( eq(X1,X2)
=> eq(X0,X2) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: frac,X2: frac,X3: frac] :
( eq(X1,X2)
=> ( eq(X2,X3)
=> eq(X1,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',satz39) ).
tff(f38,plain,
~ eq(y,z),
inference(unit_resulting_resolution,[],[f34,f27]) ).
tff(f27,plain,
! [X0: frac,X1: frac] :
( ~ eq(X0,X1)
| eq(X1,X0) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
! [X0: frac,X1: frac] :
( eq(X1,X0)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
! [X0: frac,X1: frac] :
( eq(X0,X1)
=> eq(X1,X0) ),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
! [X1: frac,X2: frac] :
( eq(X1,X2)
=> eq(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',satz38) ).
tff(f34,plain,
~ eq(z,y),
inference(unit_resulting_resolution,[],[f30,f24,f28]) ).
tff(f24,plain,
~ eq(z,u),
inference(cnf_transformation,[],[f15]) ).
tff(f15,plain,
( ~ eq(z,u)
& ~ moref(z,u) ),
inference(ennf_transformation,[],[f9]) ).
tff(f9,negated_conjecture,
~ ( ~ moref(z,u)
=> eq(z,u) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
( ~ moref(z,u)
=> eq(z,u) ),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',satz46) ).
tff(f30,plain,
eq(y,u),
inference(cnf_transformation,[],[f3]) ).
tff(f3,axiom,
eq(y,u),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',f) ).
tff(f29,plain,
eq(x,z),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
eq(x,z),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',e) ).
tff(f48,plain,
eq(y,x),
inference(unit_resulting_resolution,[],[f41,f27]) ).
tff(f41,plain,
eq(x,y),
inference(unit_resulting_resolution,[],[f36,f26]) ).
tff(f26,plain,
( eq(x,y)
| moref(x,y) ),
inference(cnf_transformation,[],[f18]) ).
tff(f18,plain,
( eq(x,y)
| moref(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
( ~ moref(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',m) ).
tff(f36,plain,
~ moref(x,y),
inference(unit_resulting_resolution,[],[f30,f33,f32]) ).
tff(f32,plain,
! [X3: frac,X0: frac,X1: frac] :
( ~ sP0(X0,X3)
| ~ eq(X1,X3)
| ~ moref(X0,X1) ),
inference(general_splitting,[],[f25,f31_D]) ).
tff(f31,plain,
! [X2: frac,X3: frac,X0: frac] :
( sP0(X0,X3)
| moref(X2,X3)
| ~ eq(X0,X2) ),
inference(cnf_transformation,[],[f31_D]) ).
tff(f31_D,plain,
! [X3,X0] :
( ! [X2] :
( moref(X2,X3)
| ~ eq(X0,X2) )
<=> ~ sP0(X0,X3) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).
tff(f25,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ~ moref(X0,X1)
| ~ eq(X0,X2)
| ~ eq(X1,X3)
| moref(X2,X3) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(flattening,[],[f16]) ).
tff(f16,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ moref(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
tff(f10,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( moref(X0,X1)
=> ( eq(X0,X2)
=> ( eq(X1,X3)
=> moref(X2,X3) ) ) ),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( moref(X1,X2)
=> ( eq(X1,X3)
=> ( eq(X2,X4)
=> moref(X3,X4) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928',satz44) ).
tff(f33,plain,
sP0(x,u),
inference(unit_resulting_resolution,[],[f29,f23,f31]) ).
tff(f23,plain,
~ moref(z,u),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM739_8 : TPTP v8.1.2. Released v8.0.0.
% 0.03/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.37 % Computer : n022.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Tue Apr 30 16:44:13 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a TX0_THM_NEQ_NAR problem
% 0.15/0.37 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.yv3ieEpmRp/Vampire---4.8_3928
% 0.58/0.75 % (4188)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.58/0.76 % (4188)First to succeed.
% 0.58/0.76 % (4182)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.58/0.76 % (4183)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.58/0.76 % (4185)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.76 % (4187)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.76 % (4184)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.76 % (4189)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.58/0.76 % (4188)Refutation found. Thanks to Tanya!
% 0.58/0.76 % SZS status Theorem for Vampire---4
% 0.58/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.76 % (4188)------------------------------
% 0.58/0.76 % (4188)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.76 % (4188)Termination reason: Refutation
% 0.58/0.76
% 0.58/0.76 % (4188)Memory used [KB]: 974
% 0.58/0.76 % (4188)Time elapsed: 0.002 s
% 0.58/0.76 % (4188)Instructions burned: 3 (million)
% 0.58/0.76 % (4188)------------------------------
% 0.58/0.76 % (4188)------------------------------
% 0.58/0.76 % (4177)Success in time 0.379 s
% 0.58/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------