TSTP Solution File: NUM948_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM948_5 : TPTP v8.1.2. Released v6.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 : n004.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:16:54 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 35
% Syntax : Number of formulae : 57 ( 10 unt; 29 typ; 0 def)
% Number of atoms : 98 ( 7 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 112 ( 42 ~; 34 |; 29 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 18 ( 11 >; 7 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 4 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 35 ( 14 !; 5 ?; 35 :)
% ( 16 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
bit0: int > int ).
tff(func_def_5,type,
bit1: int > int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
fFalse: bool ).
tff(func_def_9,type,
fTrue: bool ).
tff(func_def_10,type,
m: int ).
tff(func_def_11,type,
s1: int ).
tff(func_def_12,type,
sK0: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
zcong: ( int * int * int ) > $o ).
tff(pred_def_10,type,
zprime: int > $o ).
tff(pred_def_11,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_12,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
pp: bool > $o ).
tff(pred_def_15,type,
sQ1_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f594,plain,
$false,
inference(avatar_sat_refutation,[],[f552,f553,f575]) ).
tff(f575,plain,
~ spl2_1,
inference(avatar_contradiction_clause,[],[f574]) ).
tff(f574,plain,
( $false
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f573,f311]) ).
tff(f311,plain,
zcong(s1,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f258]) ).
tff(f258,plain,
( ! [X1: int] :
( ( sK0 = X1 )
| ~ zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X1) )
& zcong(s1,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f203,f257]) ).
tff(f257,plain,
( ? [X0: int] :
( ! [X1: int] :
( ( X0 = X1 )
| ~ zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X1) )
& zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X0) )
=> ( ! [X1: int] :
( ( sK0 = X1 )
| ~ zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X1) )
& zcong(s1,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f203,plain,
? [X0: int] :
( ! [X1: int] :
( ( X0 = X1 )
| ~ zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X1) )
& zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X0) ),
inference(flattening,[],[f202]) ).
tff(f202,plain,
? [X0: int] :
( ! [X1: int] :
( ( X0 = X1 )
| ~ zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X1) )
& zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X0) ),
inference(ennf_transformation,[],[f113]) ).
tff(f113,plain,
? [X0: int] :
( ! [X1: int] :
( ( zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X1) )
=> ( X0 = X1 ) )
& zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X0) ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
? [X1: int] :
( ! [X2: int] :
( ( zcong(s1,X2,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X2,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X2) )
=> ( X1 = X2 ) )
& zcong(s1,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X1,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X1) ),
file('/export/starexec/sandbox/tmp/tmp.dL0Oe7Ab0P/Vampire---4.8_13916',fact_0__096EX_B_As_O_A0_A_060_061_As_A_G_As_A_060_A4_A_K_Am_A_L_A1_A_G_A_091s1_A_061_As_093_A_Imod_A4_A_K_Am_A_L_A1_J_096) ).
tff(f573,plain,
( ~ zcong(s1,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ spl2_1 ),
inference(subsumption_resolution,[],[f554,f309]) ).
tff(f309,plain,
ord_less_eq(int,zero_zero(int),sK0),
inference(cnf_transformation,[],[f258]) ).
tff(f554,plain,
( ~ ord_less_eq(int,zero_zero(int),sK0)
| ~ zcong(s1,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ spl2_1 ),
inference(resolution,[],[f547,f310]) ).
tff(f310,plain,
ord_less(int,sK0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f258]) ).
tff(f547,plain,
( ! [X0: int] :
( ~ ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X0)
| ~ zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f546]) ).
tff(f546,plain,
( spl2_1
<=> ! [X0: int] :
( ~ zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X0)
| ~ ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
tff(f553,plain,
~ spl2_2,
inference(avatar_split_clause,[],[f471,f549]) ).
tff(f549,plain,
( spl2_2
<=> thesis ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
tff(f471,plain,
~ thesis,
inference(cnf_transformation,[],[f200]) ).
tff(f200,plain,
~ thesis,
inference(flattening,[],[f112]) ).
tff(f112,negated_conjecture,
~ thesis,
inference(negated_conjecture,[],[f111]) ).
tff(f111,conjecture,
thesis,
file('/export/starexec/sandbox/tmp/tmp.dL0Oe7Ab0P/Vampire---4.8_13916',conj_1) ).
tff(f552,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f470,f549,f546]) ).
tff(f470,plain,
! [X0: int] :
( thesis
| ~ zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X0) ),
inference(cnf_transformation,[],[f256]) ).
tff(f256,plain,
! [X0: int] :
( thesis
| ~ zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X0) ),
inference(flattening,[],[f255]) ).
tff(f255,plain,
! [X0: int] :
( thesis
| ~ zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
| ~ ord_less_eq(int,zero_zero(int),X0) ),
inference(ennf_transformation,[],[f199]) ).
tff(f199,plain,
! [X0: int] :
( ( zcong(s1,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X0,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X0) )
=> thesis ),
inference(rectify,[],[f110]) ).
tff(f110,axiom,
! [X26: int] :
( ( zcong(s1,X26,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less(int,X26,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)))
& ord_less_eq(int,zero_zero(int),X26) )
=> thesis ),
file('/export/starexec/sandbox/tmp/tmp.dL0Oe7Ab0P/Vampire---4.8_13916',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM948_5 : TPTP v8.1.2. Released v6.0.0.
% 0.04/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.16/0.36 % Computer : n004.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 14:53:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TF1_THM_EQU_NAR problem
% 0.16/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.dL0Oe7Ab0P/Vampire---4.8_13916
% 0.60/0.76 % (14183)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.60/0.76 % (14177)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.60/0.76 % (14183)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.76 % (14180)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.60/0.76 % (14178)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.60/0.76 % (14179)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.60/0.76 % (14181)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.60/0.76 % (14182)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.60/0.76 % (14183)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.77 % (14181)First to succeed.
% 0.60/0.77 % (14181)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-14173"
% 0.60/0.77 % (14182)Refutation not found, incomplete strategy% (14182)------------------------------
% 0.60/0.77 % (14182)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (14182)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (14182)Memory used [KB]: 1247
% 0.60/0.77 % (14182)Time elapsed: 0.009 s
% 0.60/0.77 % (14182)Instructions burned: 15 (million)
% 0.60/0.77 % (14182)------------------------------
% 0.60/0.77 % (14182)------------------------------
% 0.60/0.77 % (14181)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for Vampire---4
% 0.60/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.77 % (14181)------------------------------
% 0.60/0.77 % (14181)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (14181)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (14181)Memory used [KB]: 1258
% 0.60/0.77 % (14181)Time elapsed: 0.009 s
% 0.60/0.77 % (14181)Instructions burned: 14 (million)
% 0.60/0.77 % (14173)Success in time 0.393 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------