TSTP Solution File: NUM788_8 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM788_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 : n026.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 : Sun May 5 08:15:35 EDT 2024
% Result : Theorem 0.56s 0.75s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 32 ( 5 unt; 6 typ; 0 def)
% Number of atoms : 67 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 92 ( 51 ~; 17 |; 4 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 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 : 6 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 14 ( 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
rat: $tType ).
tff(func_def_0,type,
x0: rat ).
tff(func_def_1,type,
y0: rat ).
tff(pred_def_1,type,
more: ( rat * rat ) > $o ).
tff(pred_def_2,type,
less: ( rat * rat ) > $o ).
tff(pred_def_3,type,
is: ( rat * rat ) > $o ).
tff(f49,plain,
$false,
inference(avatar_sat_refutation,[],[f28,f38,f48]) ).
tff(f48,plain,
~ spl0_1,
inference(avatar_contradiction_clause,[],[f47]) ).
tff(f47,plain,
( $false
| ~ spl0_1 ),
inference(subsumption_resolution,[],[f43,f16]) ).
tff(f16,plain,
more(x0,y0),
inference(cnf_transformation,[],[f1]) ).
tff(f1,axiom,
more(x0,y0),
file('/export/starexec/sandbox/tmp/tmp.pc6cgATRw5/Vampire---4.8_20350',m) ).
tff(f43,plain,
( ~ more(x0,y0)
| ~ spl0_1 ),
inference(resolution,[],[f23,f19]) ).
tff(f19,plain,
! [X0: rat,X1: rat] :
( ~ is(X0,X1)
| ~ more(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
tff(f13,plain,
! [X0: rat,X1: rat] :
( ( ~ is(X0,X1)
| ~ less(X0,X1) )
& ( ~ less(X0,X1)
| ~ more(X0,X1) )
& ( ~ more(X0,X1)
| ~ is(X0,X1) ) ),
inference(flattening,[],[f12]) ).
tff(f12,plain,
! [X0: rat,X1: rat] :
( ( ~ is(X0,X1)
| ~ less(X0,X1) )
& ( ~ less(X0,X1)
| ~ more(X0,X1) )
& ( ~ more(X0,X1)
| ~ is(X0,X1) ) ),
inference(ennf_transformation,[],[f8]) ).
tff(f8,plain,
! [X0: rat,X1: rat] :
~ ( ( is(X0,X1)
=> ~ more(X0,X1) )
=> ( ( more(X0,X1)
=> ~ less(X0,X1) )
=> ~ ( less(X0,X1)
=> ~ is(X0,X1) ) ) ),
inference(flattening,[],[f7]) ).
tff(f7,plain,
! [X0: rat,X1: rat] :
~ ( ( is(X0,X1)
=> ~ more(X0,X1) )
=> ~ ~ ( ( more(X0,X1)
=> ~ less(X0,X1) )
=> ~ ( less(X0,X1)
=> ~ is(X0,X1) ) ) ),
inference(rectify,[],[f3]) ).
tff(f3,axiom,
! [X1: rat,X2: rat] :
~ ( ( is(X1,X2)
=> ~ more(X1,X2) )
=> ~ ~ ( ( more(X1,X2)
=> ~ less(X1,X2) )
=> ~ ( less(X1,X2)
=> ~ is(X1,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.pc6cgATRw5/Vampire---4.8_20350',satz81b) ).
tff(f23,plain,
( is(x0,y0)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f21]) ).
tff(f21,plain,
( spl0_1
<=> is(x0,y0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
tff(f38,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f37]) ).
tff(f37,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f32,f16]) ).
tff(f32,plain,
( ~ more(x0,y0)
| ~ spl0_2 ),
inference(resolution,[],[f27,f18]) ).
tff(f18,plain,
! [X0: rat,X1: rat] :
( ~ less(X0,X1)
| ~ more(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
tff(f27,plain,
( less(x0,y0)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f25]) ).
tff(f25,plain,
( spl0_2
<=> less(x0,y0) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
tff(f28,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f15,f25,f21]) ).
tff(f15,plain,
( less(x0,y0)
| is(x0,y0) ),
inference(cnf_transformation,[],[f11]) ).
tff(f11,plain,
( is(x0,y0)
| less(x0,y0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f6,plain,
( ~ less(x0,y0)
=> is(x0,y0) ),
inference(flattening,[],[f5]) ).
tff(f5,negated_conjecture,
~ ~ ( ~ less(x0,y0)
=> is(x0,y0) ),
inference(negated_conjecture,[],[f4]) ).
tff(f4,conjecture,
~ ( ~ less(x0,y0)
=> is(x0,y0) ),
file('/export/starexec/sandbox/tmp/tmp.pc6cgATRw5/Vampire---4.8_20350',satz81g) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM788_8 : TPTP v8.1.2. Released v8.0.0.
% 0.13/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 : n026.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 : Fri May 3 15:20:38 EDT 2024
% 0.21/0.36 % CPUTime :
% 0.21/0.36 This is a TX0_THM_NEQ_NAR problem
% 0.21/0.36 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.pc6cgATRw5/Vampire---4.8_20350
% 0.56/0.74 % (20588)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.56/0.74 % (20588)First to succeed.
% 0.56/0.74 % (20582)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.56/0.74 % (20585)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.56/0.74 % (20586)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 Vampire---4 for (2996ds/34Mi)
% 0.56/0.74 % (20583)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.56/0.74 % (20587)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.56/0.74 % (20588)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20581"
% 0.56/0.75 % (20588)Refutation found. Thanks to Tanya!
% 0.56/0.75 % SZS status Theorem for Vampire---4
% 0.56/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.75 % (20588)------------------------------
% 0.56/0.75 % (20588)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.75 % (20588)Termination reason: Refutation
% 0.56/0.75
% 0.56/0.75 % (20588)Memory used [KB]: 971
% 0.56/0.75 % (20588)Time elapsed: 0.002 s
% 0.56/0.75 % (20588)Instructions burned: 3 (million)
% 0.56/0.75 % (20581)Success in time 0.377 s
% 0.56/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------