TSTP Solution File: SEV065^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV065^5 : TPTP v8.2.0. Released v4.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 : n003.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 04:11:52 EDT 2024
% Result : Theorem 0.25s 0.41s
% Output : Refutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 16
% Syntax : Number of formulae : 66 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 313 ( 164 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 317 ( 60 ~; 70 |; 60 &; 118 @)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 10 con; 0-2 aty)
% Number of variables : 41 ( 22 ^ 12 !; 6 ?; 41 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_6,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_12,type,
sK0: a ).
thf(func_def_13,type,
sK1: b > a > $o ).
thf(func_def_14,type,
sK2: b ).
thf(func_def_16,type,
ph4:
!>[X0: $tType] : X0 ).
thf(func_def_17,type,
sK5: b ).
thf(func_def_18,type,
sK6: a ).
thf(f85,plain,
$false,
inference(avatar_sat_refutation,[],[f55,f60,f65,f66,f67,f77,f84]) ).
thf(f84,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(superposition,[],[f64,f50]) ).
thf(f50,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f48]) ).
thf(f48,plain,
( spl3_1
<=> ( ( sK1 @ sK5 @ sK6 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f64,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f62,plain,
( spl3_4
<=> ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f77,plain,
( ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f76]) ).
thf(f76,plain,
( $false
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f9,f70]) ).
thf(f70,plain,
( ( ( sK1 @ sK2 @ sK0 )
= $false )
| ~ spl3_2
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f68,f54]) ).
thf(f54,plain,
( ( sK2 = sK5 )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f52,plain,
( spl3_2
<=> ( sK2 = sK5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f68,plain,
( ( ( sK1 @ sK5 @ sK0 )
= $false )
| ~ spl3_3
| ~ spl3_4 ),
inference(superposition,[],[f64,f59]) ).
thf(f59,plain,
( ( sK6 = sK0 )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f57]) ).
thf(f57,plain,
( spl3_3
<=> ( sK6 = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f9,plain,
( $true
= ( sK1 @ sK2 @ sK0 ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f8,plain,
( ( sK1
!= ( ^ [Y0: b,Y1: a] :
( ( ( sK0 = Y1 )
& ( sK2 = Y0 ) )
| ( ( sK1 @ Y0 @ Y1 )
& ~ ( ( sK0 = Y1 )
& ( sK2 = Y0 ) ) ) ) ) )
& ( $true
= ( sK1 @ sK2 @ sK0 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f7]) ).
thf(f7,plain,
( ? [X0: a,X1: b > a > $o,X2: b] :
( ( ( ^ [Y0: b,Y1: a] :
( ( ( X0 = Y1 )
& ( X2 = Y0 ) )
| ( ( X1 @ Y0 @ Y1 )
& ~ ( ( X0 = Y1 )
& ( X2 = Y0 ) ) ) ) )
!= X1 )
& ( $true
= ( X1 @ X2 @ X0 ) ) )
=> ( ( sK1
!= ( ^ [Y0: b,Y1: a] :
( ( ( sK0 = Y1 )
& ( sK2 = Y0 ) )
| ( ( sK1 @ Y0 @ Y1 )
& ~ ( ( sK0 = Y1 )
& ( sK2 = Y0 ) ) ) ) ) )
& ( $true
= ( sK1 @ sK2 @ sK0 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
? [X0: a,X1: b > a > $o,X2: b] :
( ( ( ^ [Y0: b,Y1: a] :
( ( ( X0 = Y1 )
& ( X2 = Y0 ) )
| ( ( X1 @ Y0 @ Y1 )
& ~ ( ( X0 = Y1 )
& ( X2 = Y0 ) ) ) ) )
!= X1 )
& ( $true
= ( X1 @ X2 @ X0 ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: a,X1: b > a > $o,X2: b] :
( ( $true
= ( X1 @ X2 @ X0 ) )
=> ( ( ^ [Y0: b,Y1: a] :
( ( ( X0 = Y1 )
& ( X2 = Y0 ) )
| ( ( X1 @ Y0 @ Y1 )
& ~ ( ( X0 = Y1 )
& ( X2 = Y0 ) ) ) ) )
= X1 ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: a,X1: b > a > $o,X2: b] :
( ( X1 @ X2 @ X0 )
=> ( ( ^ [X3: b,X4: a] :
( ( ~ ( ( X2 = X3 )
& ( X0 = X4 ) )
& ( X1 @ X3 @ X4 ) )
| ( ( X2 = X3 )
& ( X0 = X4 ) ) ) )
= X1 ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: a,X2: b > a > $o,X0: b] :
( ( X2 @ X0 @ X1 )
=> ( ( ^ [X3: b,X4: a] :
( ( ~ ( ( X0 = X3 )
& ( X1 = X4 ) )
& ( X2 @ X3 @ X4 ) )
| ( ( X0 = X3 )
& ( X1 = X4 ) ) ) )
= X2 ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: a,X2: b > a > $o,X0: b] :
( ( X2 @ X0 @ X1 )
=> ( ( ^ [X3: b,X4: a] :
( ( ~ ( ( X0 = X3 )
& ( X1 = X4 ) )
& ( X2 @ X3 @ X4 ) )
| ( ( X0 = X3 )
& ( X1 = X4 ) ) ) )
= X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM177_pme) ).
thf(f67,plain,
( ~ spl3_3
| ~ spl3_2
| spl3_4 ),
inference(avatar_split_clause,[],[f21,f62,f52,f57]) ).
thf(f21,plain,
( ( sK6 != sK0 )
| ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( sK2 != sK5 ) ),
inference(equality_proxy_clausification,[],[f20]) ).
thf(f20,plain,
( ( ( sK0 = sK6 )
= $false )
| ( sK2 != sK5 )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(equality_proxy_clausification,[],[f19]) ).
thf(f19,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( ( sK2 = sK5 )
= $false )
| ( ( sK0 = sK6 )
= $false ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( ( ( sK0 = sK6 )
& ( sK2 = sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( ( ( ( sK0 = sK6 )
& ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ sK6 )
& ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( sK1 @ sK5 @ sK6 )
!= ( ( ( sK0 = sK6 )
& ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ sK6 )
& ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) ) ),
inference(beta_eta_normalization,[],[f13]) ).
thf(f13,plain,
( ( sK1 @ sK5 @ sK6 )
!= ( ^ [Y0: a] :
( ( ( sK0 = Y0 )
& ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ Y0 )
& ~ ( ( sK0 = Y0 )
& ( sK2 = sK5 ) ) ) )
@ sK6 ) ),
inference(negative_extensionality,[],[f12]) ).
thf(f12,plain,
( ( sK1 @ sK5 )
!= ( ^ [Y0: a] :
( ( ( sK0 = Y0 )
& ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ Y0 )
& ~ ( ( sK0 = Y0 )
& ( sK2 = sK5 ) ) ) ) ) ),
inference(beta_eta_normalization,[],[f11]) ).
thf(f11,plain,
( ( ^ [Y0: b,Y1: a] :
( ( ( sK0 = Y1 )
& ( sK2 = Y0 ) )
| ( ( sK1 @ Y0 @ Y1 )
& ~ ( ( sK0 = Y1 )
& ( sK2 = Y0 ) ) ) )
@ sK5 )
!= ( sK1 @ sK5 ) ),
inference(negative_extensionality,[],[f10]) ).
thf(f10,plain,
( sK1
!= ( ^ [Y0: b,Y1: a] :
( ( ( sK0 = Y1 )
& ( sK2 = Y0 ) )
| ( ( sK1 @ Y0 @ Y1 )
& ~ ( ( sK0 = Y1 )
& ( sK2 = Y0 ) ) ) ) ) ),
inference(cnf_transformation,[],[f8]) ).
thf(f66,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f27,f62,f57]) ).
thf(f27,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( sK6 = sK0 ) ),
inference(equality_proxy_clausification,[],[f26]) ).
thf(f26,plain,
( ( ( sK0 = sK6 )
= $true )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(binary_proxy_clausification,[],[f24]) ).
thf(f24,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( $true
= ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) ),
inference(not_proxy_clausification,[],[f23]) ).
thf(f23,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( ( ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f22]) ).
thf(f22,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $false )
| ( ( ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) )
= $false )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(binary_proxy_clausification,[],[f17]) ).
thf(f17,plain,
( ( ( ( sK1 @ sK5 @ sK6 )
& ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) )
= $false )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f65,plain,
( spl3_4
| spl3_2 ),
inference(avatar_split_clause,[],[f28,f52,f62]) ).
thf(f28,plain,
( ( sK2 = sK5 )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(equality_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( $true
= ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ sK6 )
= $false ) ),
inference(binary_proxy_clausification,[],[f24]) ).
thf(f60,plain,
( spl3_1
| spl3_3 ),
inference(avatar_split_clause,[],[f35,f57,f48]) ).
thf(f35,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ( sK6 = sK0 ) ),
inference(equality_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ( ( sK0 = sK6 )
= $true )
| ( ( sK1 @ sK5 @ sK6 )
= $true ) ),
inference(binary_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ( $true
= ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f31]) ).
thf(f31,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ( $true
= ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) )
| ( ( sK1 @ sK5 @ sK6 )
= $true ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( $true
= ( ( sK1 @ sK5 @ sK6 )
& ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) )
| ( $true
= ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) )
| ( ( sK1 @ sK5 @ sK6 )
= $true ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ( $true
= ( ( ( sK0 = sK6 )
& ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ sK6 )
& ~ ( ( sK0 = sK6 )
& ( sK2 = sK5 ) ) ) ) ) ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f55,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f36,f52,f48]) ).
thf(f36,plain,
( ( ( sK1 @ sK5 @ sK6 )
= $true )
| ( sK2 = sK5 ) ),
inference(equality_proxy_clausification,[],[f33]) ).
thf(f33,plain,
( ( $true
= ( sK2 = sK5 ) )
| ( ( sK1 @ sK5 @ sK6 )
= $true ) ),
inference(binary_proxy_clausification,[],[f32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SEV065^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.16 % 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.17/0.38 % Computer : n003.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sun May 19 19:04:38 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.17/0.38 This is a TH0_THM_EQU_NAR problem
% 0.17/0.38 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/sandbox/benchmark/theBenchmark.p
% 0.25/0.40 % (20052)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.25/0.40 % (20045)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.25/0.40 % (20046)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.25/0.40 % (20048)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.25/0.40 % (20047)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.25/0.40 % (20048)Instruction limit reached!
% 0.25/0.40 % (20048)------------------------------
% 0.25/0.40 % (20048)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.40 % (20048)Termination reason: Unknown
% 0.25/0.40 % (20048)Termination phase: Saturation
% 0.25/0.40
% 0.25/0.40 % (20048)Memory used [KB]: 895
% 0.25/0.40 % (20048)Time elapsed: 0.003 s
% 0.25/0.40 % (20048)Instructions burned: 2 (million)
% 0.25/0.40 % (20048)------------------------------
% 0.25/0.40 % (20048)------------------------------
% 0.25/0.40 % (20052)Instruction limit reached!
% 0.25/0.40 % (20052)------------------------------
% 0.25/0.40 % (20052)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.40 % (20052)Termination reason: Unknown
% 0.25/0.40 % (20052)Termination phase: Saturation
% 0.25/0.40
% 0.25/0.40 % (20052)Memory used [KB]: 5500
% 0.25/0.40 % (20052)Time elapsed: 0.004 s
% 0.25/0.40 % (20052)Instructions burned: 3 (million)
% 0.25/0.40 % (20052)------------------------------
% 0.25/0.40 % (20052)------------------------------
% 0.25/0.40 % (20051)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.25/0.40 % (20046)Instruction limit reached!
% 0.25/0.40 % (20046)------------------------------
% 0.25/0.40 % (20046)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.40 % (20046)Termination reason: Unknown
% 0.25/0.40 % (20046)Termination phase: Saturation
% 0.25/0.40
% 0.25/0.40 % (20046)Memory used [KB]: 5500
% 0.25/0.40 % (20046)Time elapsed: 0.005 s
% 0.25/0.40 % (20046)Instructions burned: 4 (million)
% 0.25/0.40 % (20046)------------------------------
% 0.25/0.40 % (20046)------------------------------
% 0.25/0.40 % (20045)First to succeed.
% 0.25/0.41 % (20047)Also succeeded, but the first one will report.
% 0.25/0.41 % (20045)Refutation found. Thanks to Tanya!
% 0.25/0.41 % SZS status Theorem for theBenchmark
% 0.25/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.25/0.41 % (20045)------------------------------
% 0.25/0.41 % (20045)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.25/0.41 % (20045)Termination reason: Refutation
% 0.25/0.41
% 0.25/0.41 % (20045)Memory used [KB]: 5500
% 0.25/0.41 % (20045)Time elapsed: 0.007 s
% 0.25/0.41 % (20045)Instructions burned: 4 (million)
% 0.25/0.41 % (20045)------------------------------
% 0.25/0.41 % (20045)------------------------------
% 0.25/0.41 % (20044)Success in time 0.011 s
% 0.25/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------