TSTP Solution File: NUM742_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM742_8 : TPTP v8.2.0. 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 : n013.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 May 21 01:45:24 EDT 2024
% Result : Theorem 0.79s 0.94s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 41 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 66 ( 28 ~; 24 |; 0 &)
% ( 1 <=>; 13 =>; 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 55 ( 55 !; 0 ?; 52 :)
% 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(pred_def_1,type,
lessf: ( frac * frac ) > $o ).
tff(pred_def_2,type,
eq: ( frac * frac ) > $o ).
tff(pred_def_3,type,
sP0: ( frac * frac ) > $o ).
tff(f52,plain,
$false,
inference(unit_resulting_resolution,[],[f28,f29,f45,f32]) ).
tff(f32,plain,
! [X3: frac,X0: frac,X1: frac] :
( ~ sP0(X0,X3)
| ~ eq(X1,X3)
| ~ lessf(X0,X1) ),
inference(general_splitting,[],[f27,f31_D]) ).
tff(f31,plain,
! [X2: frac,X3: frac,X0: frac] :
( sP0(X0,X3)
| lessf(X2,X3)
| ~ eq(X0,X2) ),
inference(cnf_transformation,[],[f31_D]) ).
tff(f31_D,plain,
! [X3,X0] :
( ! [X2] :
( lessf(X2,X3)
| ~ eq(X0,X2) )
<=> ~ sP0(X0,X3) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).
tff(f27,plain,
! [X2: frac,X3: frac,X0: frac,X1: frac] :
( ~ lessf(X0,X1)
| ~ eq(X0,X2)
| ~ eq(X1,X3)
| lessf(X2,X3) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( lessf(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ lessf(X0,X1) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( lessf(X2,X3)
| ~ eq(X1,X3)
| ~ eq(X0,X2)
| ~ lessf(X0,X1) ),
inference(ennf_transformation,[],[f12]) ).
tff(f12,plain,
! [X0: frac,X1: frac,X2: frac,X3: frac] :
( lessf(X0,X1)
=> ( eq(X0,X2)
=> ( eq(X1,X3)
=> lessf(X2,X3) ) ) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X1: frac,X2: frac,X3: frac,X4: frac] :
( lessf(X1,X2)
=> ( eq(X1,X3)
=> ( eq(X2,X4)
=> lessf(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz45) ).
tff(f45,plain,
sP0(y,z),
inference(unit_resulting_resolution,[],[f24,f39,f31]) ).
tff(f39,plain,
eq(y,x),
inference(unit_resulting_resolution,[],[f35,f30]) ).
tff(f30,plain,
! [X0: frac,X1: frac] :
( ~ eq(X0,X1)
| eq(X1,X0) ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: frac,X1: frac] :
( eq(X1,X0)
| ~ eq(X0,X1) ),
inference(ennf_transformation,[],[f14]) ).
tff(f14,plain,
! [X0: frac,X1: frac] :
( eq(X0,X1)
=> eq(X1,X0) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X1: frac,X2: frac] :
( eq(X1,X2)
=> eq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz38) ).
tff(f35,plain,
eq(x,y),
inference(unit_resulting_resolution,[],[f33,f25]) ).
tff(f25,plain,
( eq(x,y)
| lessf(x,y) ),
inference(cnf_transformation,[],[f17]) ).
tff(f17,plain,
( eq(x,y)
| lessf(x,y) ),
inference(ennf_transformation,[],[f1]) ).
tff(f1,axiom,
( ~ lessf(x,y)
=> eq(x,y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(f33,plain,
~ lessf(x,y),
inference(unit_resulting_resolution,[],[f28,f24,f26]) ).
tff(f26,plain,
! [X2: frac,X0: frac,X1: frac] :
( ~ lessf(X1,X2)
| ~ lessf(X0,X1)
| lessf(X0,X2) ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ~ lessf(X0,X1) ),
inference(flattening,[],[f18]) ).
tff(f18,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X2)
| ~ lessf(X1,X2)
| ~ lessf(X0,X1) ),
inference(ennf_transformation,[],[f11]) ).
tff(f11,plain,
! [X0: frac,X1: frac,X2: frac] :
( lessf(X0,X1)
=> ( lessf(X1,X2)
=> lessf(X0,X2) ) ),
inference(rectify,[],[f6]) ).
tff(f6,axiom,
! [X1: frac,X2: frac,X3: frac] :
( lessf(X1,X2)
=> ( lessf(X2,X3)
=> lessf(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz50) ).
tff(f24,plain,
~ lessf(x,z),
inference(cnf_transformation,[],[f10]) ).
tff(f10,plain,
~ lessf(x,z),
inference(flattening,[],[f9]) ).
tff(f9,negated_conjecture,
~ lessf(x,z),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
lessf(x,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz51a) ).
tff(f29,plain,
! [X0: frac] : eq(X0,X0),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: frac] : eq(X0,X0),
inference(rectify,[],[f7]) ).
tff(f7,axiom,
! [X1: frac] : eq(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
tff(f28,plain,
lessf(y,z),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
lessf(y,z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM742_8 : TPTP v8.2.0. Released v8.0.0.
% 0.07/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.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 04:23:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 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/benchmark/theBenchmark.p
% 0.69/0.93 % (26876)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.69/0.93 % (26873)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 theBenchmark for (2994ds/34Mi)
% 0.69/0.93 % (26875)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.69/0.93 % (26878)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.69/0.93 % (26877)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.69/0.93 % (26874)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 theBenchmark for (2994ds/51Mi)
% 0.69/0.93 % (26879)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 theBenchmark for (2994ds/83Mi)
% 0.69/0.93 % (26880)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.69/0.93 % (26879)First to succeed.
% 0.69/0.93 % (26880)Also succeeded, but the first one will report.
% 0.69/0.93 % (26879)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-26872"
% 0.79/0.93 % (26874)Also succeeded, but the first one will report.
% 0.79/0.93 % (26875)Also succeeded, but the first one will report.
% 0.79/0.94 % (26879)Refutation found. Thanks to Tanya!
% 0.79/0.94 % SZS status Theorem for theBenchmark
% 0.79/0.94 % SZS output start Proof for theBenchmark
% See solution above
% 0.79/0.94 % (26879)------------------------------
% 0.79/0.94 % (26879)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.79/0.94 % (26879)Termination reason: Refutation
% 0.79/0.94
% 0.79/0.94 % (26879)Memory used [KB]: 975
% 0.79/0.94 % (26879)Time elapsed: 0.003 s
% 0.79/0.94 % (26879)Instructions burned: 3 (million)
% 0.79/0.94 % (26872)Success in time 0.563 s
% 0.79/0.94 % Vampire---4.8 exiting
%------------------------------------------------------------------------------