TSTP Solution File: NUM785^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM785^1 : TPTP v8.2.0. Released v3.7.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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:56 EDT 2024
% Result : Theorem 0.08s 0.30s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 39 ( 11 unt; 7 typ; 0 def)
% Number of atoms : 173 ( 48 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 238 ( 63 ~; 15 |; 4 &; 130 @)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 16 ( 0 ^ 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(func_def_0,type,
rat: $tType ).
thf(func_def_1,type,
x0: rat ).
thf(func_def_2,type,
y0: rat ).
thf(func_def_3,type,
less: rat > rat > $o ).
thf(func_def_4,type,
is: rat > rat > $o ).
thf(func_def_6,type,
more: rat > rat > $o ).
thf(f46,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f41,f45]) ).
thf(f45,plain,
~ spl0_2,
inference(avatar_contradiction_clause,[],[f44]) ).
thf(f44,plain,
( $false
| ~ spl0_2 ),
inference(subsumption_resolution,[],[f43,f37]) ).
thf(f37,plain,
( ( ( less @ x0 @ y0 )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f35]) ).
thf(f35,plain,
( spl0_2
<=> ( ( less @ x0 @ y0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f43,plain,
( ( less @ x0 @ y0 )
!= $true ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
( ( $true != $true )
| ( ( less @ x0 @ y0 )
!= $true ) ),
inference(superposition,[],[f26,f28]) ).
thf(f28,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( more @ x0 @ y0 )
= $true ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
~ ( ( ( more @ x0 @ y0 )
!= $true ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ~ ( more @ x0 @ y0 ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ~ ( more @ x0 @ y0 ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
~ ( more @ x0 @ y0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz81d) ).
thf(f26,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( less @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: rat,X1: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
! [X1: rat,X0: rat] :
( ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) )
& ( ( ( less @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) )
& ( ( ( is @ X0 @ X1 )
!= $true )
| ( ( more @ X0 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f16,plain,
! [X1: rat,X0: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
! [X0: rat,X1: rat] :
~ ( ( ( ( is @ X0 @ X1 )
= $true )
=> ( ( more @ X0 @ X1 )
!= $true ) )
=> ~ ~ ( ( ( ( more @ X0 @ X1 )
= $true )
=> ( ( less @ X0 @ X1 )
!= $true ) )
=> ~ ( ( ( less @ X0 @ X1 )
= $true )
=> ( ( is @ X0 @ X1 )
!= $true ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,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]) ).
thf(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/sandbox2/benchmark/theBenchmark.p',satz81b) ).
thf(f41,plain,
~ spl0_1,
inference(avatar_split_clause,[],[f40,f31]) ).
thf(f31,plain,
( spl0_1
<=> ( ( is @ x0 @ y0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f40,plain,
( ( is @ x0 @ y0 )
!= $true ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( ( is @ x0 @ y0 )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f24,f28]) ).
thf(f24,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
!= $true )
| ( ( is @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f38,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f27,f35,f31]) ).
thf(f27,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
( ( ( is @ x0 @ y0 )
= $true )
| ( ( less @ x0 @ y0 )
= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
( ( ( less @ x0 @ y0 )
!= $true )
=> ( ( is @ x0 @ y0 )
= $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( less @ x0 @ y0 )
=> ( is @ x0 @ y0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : NUM785^1 : TPTP v8.2.0. Released v3.7.0.
% 0.00/0.09 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.08/0.28 % Computer : n011.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Mon May 20 07:09:08 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.08/0.28 This is a TH0_THM_NEQ_NAR problem
% 0.08/0.28 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.29 % (6715)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.08/0.29 % (6713)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (3000ds/4Mi)
% 0.08/0.29 % (6715)Instruction limit reached!
% 0.08/0.29 % (6715)------------------------------
% 0.08/0.29 % (6715)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.29 % (6715)Termination reason: Unknown
% 0.08/0.29 % (6715)Termination phase: Property scanning
% 0.08/0.29
% 0.08/0.29 % (6715)Memory used [KB]: 895
% 0.08/0.29 % (6715)Time elapsed: 0.002 s
% 0.08/0.29 % (6715)Instructions burned: 2 (million)
% 0.08/0.29 % (6715)------------------------------
% 0.08/0.29 % (6715)------------------------------
% 0.08/0.29 % (6719)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.08/0.29 % (6714)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (3000ds/27Mi)
% 0.08/0.29 % (6712)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.08/0.29 % (6717)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (3000ds/275Mi)
% 0.08/0.29 % (6719)First to succeed.
% 0.08/0.30 % (6713)Instruction limit reached!
% 0.08/0.30 % (6713)------------------------------
% 0.08/0.30 % (6713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6713)Termination reason: Unknown
% 0.08/0.30 % (6713)Termination phase: Saturation
% 0.08/0.30
% 0.08/0.30 % (6713)Memory used [KB]: 5500
% 0.08/0.30 % (6713)Time elapsed: 0.004 s
% 0.08/0.30 % (6713)Instructions burned: 5 (million)
% 0.08/0.30 % (6713)------------------------------
% 0.08/0.30 % (6713)------------------------------
% 0.08/0.30 % (6719)Refutation found. Thanks to Tanya!
% 0.08/0.30 % SZS status Theorem for theBenchmark
% 0.08/0.30 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.30 % (6719)------------------------------
% 0.08/0.30 % (6719)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.08/0.30 % (6719)Termination reason: Refutation
% 0.08/0.30
% 0.08/0.30 % (6719)Memory used [KB]: 5500
% 0.08/0.30 % (6719)Time elapsed: 0.002 s
% 0.08/0.30 % (6719)Instructions burned: 2 (million)
% 0.08/0.30 % (6719)------------------------------
% 0.08/0.30 % (6719)------------------------------
% 0.08/0.30 % (6707)Success in time 0.009 s
% 0.08/0.30 % Vampire---4.8 exiting
%------------------------------------------------------------------------------