TSTP Solution File: NUM667^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM667^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 : n021.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:44:28 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 59 ( 3 unt; 6 typ; 0 def)
% Number of atoms : 212 ( 75 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 251 ( 70 ~; 38 |; 4 &; 110 @)
% ( 4 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 9 con; 0-2 aty)
% Number of variables : 26 ( 0 ^ 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
z: nat ).
thf(func_def_4,type,
less: nat > nat > $o ).
thf(f83,plain,
$false,
inference(avatar_sat_refutation,[],[f57,f66,f68,f71,f79,f82]) ).
thf(f82,plain,
( ~ spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f81]) ).
thf(f81,plain,
( $false
| ~ spl0_1
| ~ spl0_4 ),
inference(subsumption_resolution,[],[f80,f45]) ).
thf(f45,plain,
( ( less @ x @ z )
!= $true ),
inference(cnf_transformation,[],[f34]) ).
thf(f34,plain,
( ( ( less @ x @ z )
!= $true )
& ( x != z ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
~ ( ( ( less @ x @ z )
!= $true )
=> ( x = z ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
~ ( ( ( less @ x @ z )
!= $true )
=> ( x = z ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
~ ( ~ ( less @ x @ z )
=> ( x = z ) ),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ ( ~ ( less @ x @ z )
=> ( x = z ) ),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
( ~ ( less @ x @ z )
=> ( x = z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz17) ).
thf(f80,plain,
( ( ( less @ x @ z )
= $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f52,f65]) ).
thf(f65,plain,
( ( x = y )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f63]) ).
thf(f63,plain,
( spl0_4
<=> ( x = y ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f52,plain,
( ( ( less @ y @ z )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl0_1
<=> ( ( less @ y @ z )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f79,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f78]) ).
thf(f78,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f76,f52]) ).
thf(f76,plain,
( ( ( less @ y @ z )
!= $true )
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( ( less @ y @ z )
!= $true )
| ( $true != $true )
| ~ spl0_3 ),
inference(superposition,[],[f73,f61]) ).
thf(f61,plain,
( ( ( less @ x @ y )
= $true )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl0_3
<=> ( ( less @ x @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f73,plain,
! [X0: nat] :
( ( ( less @ x @ X0 )
!= $true )
| ( ( less @ X0 @ z )
!= $true ) ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f72,plain,
! [X0: nat] :
( ( ( less @ x @ X0 )
!= $true )
| ( $true != $true )
| ( ( less @ X0 @ z )
!= $true ) ),
inference(superposition,[],[f45,f42]) ).
thf(f42,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( $true
= ( less @ X0 @ X1 ) )
| ( ( less @ X2 @ X1 )
!= $true )
| ( ( less @ X0 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( $true
= ( less @ X0 @ X1 ) )
| ( ( X0 != X2 )
& ( ( less @ X0 @ X2 )
!= $true ) )
| ( ( less @ X2 @ X1 )
!= $true ) ),
inference(rectify,[],[f33]) ).
thf(f33,plain,
! [X2: nat,X0: nat,X1: nat] :
( ( ( less @ X2 @ X0 )
= $true )
| ( ( X1 != X2 )
& ( ( less @ X2 @ X1 )
!= $true ) )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(flattening,[],[f32]) ).
thf(f32,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( less @ X2 @ X0 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true )
| ( ( X1 != X2 )
& ( ( less @ X2 @ X1 )
!= $true ) ) ),
inference(ennf_transformation,[],[f24]) ).
thf(f24,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( ( less @ X2 @ X1 )
!= $true )
=> ( X1 = X2 ) )
=> ( ( ( less @ X1 @ X0 )
= $true )
=> ( ( less @ X2 @ X0 )
= $true ) ) ),
inference(flattening,[],[f16]) ).
thf(f16,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ( ( less @ X2 @ X1 )
!= $true )
=> ( X1 = X2 ) )
=> ( ( ( less @ X1 @ X0 )
= $true )
=> ( ( less @ X2 @ X0 )
= $true ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat,X2: nat] :
( ( ~ ( less @ X2 @ X1 )
=> ( X1 = X2 ) )
=> ( ( less @ X1 @ X0 )
=> ( less @ X2 @ X0 ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: nat,X2: nat,X1: nat] :
( ( ~ ( less @ X1 @ X2 )
=> ( X1 = X2 ) )
=> ( ( less @ X2 @ X3 )
=> ( less @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz16a) ).
thf(f71,plain,
( ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f70]) ).
thf(f70,plain,
( $false
| ~ spl0_2
| ~ spl0_3 ),
inference(subsumption_resolution,[],[f69,f61]) ).
thf(f69,plain,
( ( ( less @ x @ y )
!= $true )
| ~ spl0_2 ),
inference(superposition,[],[f45,f56]) ).
thf(f56,plain,
( ( y = z )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_2
<=> ( y = z ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f68,plain,
( ~ spl0_4
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f67,f54,f63]) ).
thf(f67,plain,
( ( x != y )
| ~ spl0_2 ),
inference(superposition,[],[f44,f56]) ).
thf(f44,plain,
x != z,
inference(cnf_transformation,[],[f34]) ).
thf(f66,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f37,f63,f59]) ).
thf(f37,plain,
( ( x = y )
| ( ( less @ x @ y )
= $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( ( x = y )
| ( ( less @ x @ y )
= $true ) ),
inference(ennf_transformation,[],[f22]) ).
thf(f22,plain,
( ( ( less @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f12]) ).
thf(f12,plain,
( ( ( less @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
( ~ ( less @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ~ ( less @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(f57,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f38,f54,f50]) ).
thf(f38,plain,
( ( y = z )
| ( ( less @ y @ z )
= $true ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( ( ( less @ y @ z )
= $true )
| ( y = z ) ),
inference(ennf_transformation,[],[f21]) ).
thf(f21,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
( ( ( less @ y @ z )
!= $true )
=> ( y = z ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
( ~ ( less @ y @ z )
=> ( y = z ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
( ~ ( less @ y @ z )
=> ( y = z ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM667^1 : TPTP v8.2.0. Released v3.7.0.
% 0.14/0.14 % 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.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % 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 06:59:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 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.15/0.38 % (10852)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.15/0.38 % (10853)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 (2999ds/4Mi)
% 0.15/0.38 % (10854)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 (2999ds/27Mi)
% 0.15/0.38 % (10855)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (10857)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 (2999ds/275Mi)
% 0.15/0.38 % (10856)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.38 % (10858)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.38 % (10859)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.38 % (10855)Instruction limit reached!
% 0.15/0.38 % (10855)------------------------------
% 0.15/0.38 % (10855)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10855)Termination reason: Unknown
% 0.15/0.38 % (10855)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (10856)Instruction limit reached!
% 0.15/0.38 % (10856)------------------------------
% 0.15/0.38 % (10856)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10855)Memory used [KB]: 5373
% 0.15/0.38 % (10855)Time elapsed: 0.003 s
% 0.15/0.38 % (10855)Instructions burned: 2 (million)
% 0.15/0.38 % (10855)------------------------------
% 0.15/0.38 % (10855)------------------------------
% 0.15/0.38 % (10856)Termination reason: Unknown
% 0.15/0.38 % (10856)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (10856)Memory used [KB]: 895
% 0.15/0.38 % (10856)Time elapsed: 0.003 s
% 0.15/0.38 % (10856)Instructions burned: 2 (million)
% 0.15/0.38 % (10856)------------------------------
% 0.15/0.38 % (10856)------------------------------
% 0.15/0.38 % (10859)Instruction limit reached!
% 0.15/0.38 % (10859)------------------------------
% 0.15/0.38 % (10859)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10859)Termination reason: Unknown
% 0.15/0.38 % (10859)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (10859)Memory used [KB]: 5500
% 0.15/0.38 % (10859)Time elapsed: 0.004 s
% 0.15/0.38 % (10859)Instructions burned: 3 (million)
% 0.15/0.38 % (10859)------------------------------
% 0.15/0.38 % (10859)------------------------------
% 0.15/0.38 % (10853)Instruction limit reached!
% 0.15/0.38 % (10853)------------------------------
% 0.15/0.38 % (10853)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10853)Termination reason: Unknown
% 0.15/0.38 % (10853)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (10853)Memory used [KB]: 5500
% 0.15/0.38 % (10853)Time elapsed: 0.005 s
% 0.15/0.38 % (10853)Instructions burned: 5 (million)
% 0.15/0.38 % (10853)------------------------------
% 0.15/0.38 % (10853)------------------------------
% 0.15/0.38 % (10852)First to succeed.
% 0.15/0.38 % (10857)Also succeeded, but the first one will report.
% 0.15/0.38 % (10852)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.38 % (10852)------------------------------
% 0.15/0.38 % (10852)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (10852)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (10852)Memory used [KB]: 5500
% 0.15/0.38 % (10852)Time elapsed: 0.006 s
% 0.15/0.38 % (10852)Instructions burned: 4 (million)
% 0.15/0.38 % (10852)------------------------------
% 0.15/0.38 % (10852)------------------------------
% 0.15/0.38 % (10851)Success in time 0.015 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------