TSTP Solution File: SYO359^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO359^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 : n028.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 09:04:08 EDT 2024
% Result : Theorem 0.23s 0.40s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 16
% Syntax : Number of formulae : 51 ( 5 unt; 10 typ; 0 def)
% Number of atoms : 219 ( 54 equ; 0 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 198 ( 41 ~; 37 |; 6 &; 87 @)
% ( 10 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 25 ( 0 ^ 21 !; 3 ?; 25 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_7,type,
gtype: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
gtype: $tType ).
thf(func_def_2,type,
g: b > $o ).
thf(func_def_3,type,
h: ( b > $o ) > gtype ).
thf(func_def_4,type,
f: b > $o ).
thf(func_def_8,type,
sK0: b ).
thf(func_def_11,type,
ph2:
!>[X0: $tType] : X0 ).
thf(func_def_12,type,
sK3: b ).
thf(f100,plain,
$false,
inference(avatar_sat_refutation,[],[f54,f63,f77,f80,f84,f99]) ).
thf(f99,plain,
( spl1_8
| ~ spl1_9 ),
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| spl1_8
| ~ spl1_9 ),
inference(subsumption_resolution,[],[f93,f57]) ).
thf(f57,plain,
( ( ( f @ sK3 )
!= $false )
| spl1_8 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f56,plain,
( spl1_8
<=> ( ( f @ sK3 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_8])]) ).
thf(f93,plain,
( ( ( f @ sK3 )
= $false )
| ~ spl1_9 ),
inference(trivial_inequality_removal,[],[f91]) ).
thf(f91,plain,
( ( ( f @ sK3 )
= $false )
| ( $true = $false )
| ~ spl1_9 ),
inference(superposition,[],[f62,f16]) ).
thf(f16,plain,
! [X2: b] :
( ( $true
= ( g @ X2 ) )
| ( $false
= ( f @ X2 ) ) ),
inference(binary_proxy_clausification,[],[f10]) ).
thf(f10,plain,
! [X2: b] :
( ( f @ X2 )
= ( g @ X2 ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( ( ( f @ sK0 )
!= ( g @ sK0 ) )
| ! [X1: ( b > $o ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ) )
& ( ( h @ f )
!= ( h @ g ) )
& ! [X2: b] :
( ( f @ X2 )
= ( g @ X2 ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: b] :
( ( f @ X0 )
!= ( g @ X0 ) )
=> ( ( f @ sK0 )
!= ( g @ sK0 ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ( ? [X0: b] :
( ( f @ X0 )
!= ( g @ X0 ) )
| ! [X1: ( b > $o ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ) )
& ( ( h @ f )
!= ( h @ g ) )
& ! [X2: b] :
( ( f @ X2 )
= ( g @ X2 ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( ( ( h @ f )
!= ( h @ g ) )
& ! [X2: b] :
( ( f @ X2 )
= ( g @ X2 ) )
& ( ? [X0: b] :
( ( f @ X0 )
!= ( g @ X0 ) )
| ! [X1: ( b > $o ) > $o] :
( ( ( X1 @ f )
!= $true )
| ( ( X1 @ g )
= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: b] :
( ( f @ X0 )
= ( g @ X0 ) )
=> ! [X1: ( b > $o ) > $o] :
( ( ( X1 @ f )
= $true )
=> ( ( X1 @ g )
= $true ) ) )
=> ( ! [X2: b] :
( ( f @ X2 )
= ( g @ X2 ) )
=> ( ( h @ f )
= ( h @ g ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: b] :
( ( f @ X0 )
<=> ( g @ X0 ) )
=> ! [X1: ( b > $o ) > $o] :
( ( X1 @ f )
=> ( X1 @ g ) ) )
=> ( ! [X2: b] :
( ( f @ X2 )
<=> ( g @ X2 ) )
=> ( ( h @ f )
= ( h @ g ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: b] :
( ( f @ X0 )
<=> ( g @ X0 ) )
=> ! [X1: ( b > $o ) > $o] :
( ( X1 @ f )
=> ( X1 @ g ) ) )
=> ( ! [X0: b] :
( ( f @ X0 )
<=> ( g @ X0 ) )
=> ( ( h @ f )
= ( h @ g ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: b] :
( ( f @ X0 )
<=> ( g @ X0 ) )
=> ! [X1: ( b > $o ) > $o] :
( ( X1 @ f )
=> ( X1 @ g ) ) )
=> ( ! [X0: b] :
( ( f @ X0 )
<=> ( g @ X0 ) )
=> ( ( h @ f )
= ( h @ g ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEXT1) ).
thf(f62,plain,
( ( $false
= ( g @ sK3 ) )
| ~ spl1_9 ),
inference(avatar_component_clause,[],[f60]) ).
thf(f60,plain,
( spl1_9
<=> ( $false
= ( g @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_9])]) ).
thf(f84,plain,
( ~ spl1_7
| ~ spl1_8 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| ~ spl1_7
| ~ spl1_8 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ( $true = $false )
| ~ spl1_7
| ~ spl1_8 ),
inference(forward_demodulation,[],[f53,f58]) ).
thf(f58,plain,
( ( ( f @ sK3 )
= $false )
| ~ spl1_8 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f53,plain,
( ( $true
= ( f @ sK3 ) )
| ~ spl1_7 ),
inference(avatar_component_clause,[],[f51]) ).
thf(f51,plain,
( spl1_7
<=> ( $true
= ( f @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_7])]) ).
thf(f80,plain,
( ~ spl1_6
| ~ spl1_9 ),
inference(avatar_contradiction_clause,[],[f79]) ).
thf(f79,plain,
( $false
| ~ spl1_6
| ~ spl1_9 ),
inference(trivial_inequality_removal,[],[f78]) ).
thf(f78,plain,
( ( $true = $false )
| ~ spl1_6
| ~ spl1_9 ),
inference(backward_demodulation,[],[f49,f62]) ).
thf(f49,plain,
( ( $true
= ( g @ sK3 ) )
| ~ spl1_6 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f47,plain,
( spl1_6
<=> ( $true
= ( g @ sK3 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl1_6])]) ).
thf(f77,plain,
( spl1_9
| ~ spl1_8 ),
inference(avatar_split_clause,[],[f68,f56,f60]) ).
thf(f68,plain,
( ( $false
= ( g @ sK3 ) )
| ~ spl1_8 ),
inference(trivial_inequality_removal,[],[f65]) ).
thf(f65,plain,
( ( $false
= ( g @ sK3 ) )
| ( $true = $false )
| ~ spl1_8 ),
inference(superposition,[],[f15,f58]) ).
thf(f15,plain,
! [X2: b] :
( ( $true
= ( f @ X2 ) )
| ( $false
= ( g @ X2 ) ) ),
inference(binary_proxy_clausification,[],[f10]) ).
thf(f63,plain,
( spl1_8
| spl1_9 ),
inference(avatar_split_clause,[],[f45,f60,f56]) ).
thf(f45,plain,
( ( $false
= ( g @ sK3 ) )
| ( ( f @ sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( f @ sK3 )
!= ( g @ sK3 ) ),
inference(negative_extensionality,[],[f41]) ).
thf(f41,plain,
f != g,
inference(equality_resolution,[],[f11]) ).
thf(f11,plain,
( ( h @ f )
!= ( h @ g ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f54,plain,
( spl1_6
| spl1_7 ),
inference(avatar_split_clause,[],[f44,f51,f47]) ).
thf(f44,plain,
( ( $true
= ( g @ sK3 ) )
| ( $true
= ( f @ sK3 ) ) ),
inference(binary_proxy_clausification,[],[f43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYO359^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/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.37 % Computer : n028.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 09:43:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_EQU_NAR problem
% 0.16/0.37 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.16/0.39 % (14316)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.16/0.39 % (14314)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.16/0.39 % (14318)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.16/0.39 % (14317)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.39 % (14320)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.39 % (14315)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.16/0.39 % (14318)Instruction limit reached!
% 0.16/0.39 % (14318)------------------------------
% 0.16/0.39 % (14318)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (14318)Termination reason: Unknown
% 0.16/0.39 % (14318)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (14319)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.16/0.39 % (14318)Memory used [KB]: 5500
% 0.16/0.39 % (14318)Time elapsed: 0.004 s
% 0.16/0.39 % (14318)Instructions burned: 2 (million)
% 0.16/0.39 % (14318)------------------------------
% 0.16/0.39 % (14318)------------------------------
% 0.16/0.39 % (14316)Refutation not found, incomplete strategy
% 0.16/0.39 % (14316)------------------------------
% 0.16/0.39 % (14316)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (14316)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.39
% 0.16/0.39
% 0.16/0.39 % (14316)Memory used [KB]: 5500
% 0.16/0.39 % (14316)Time elapsed: 0.005 s
% 0.16/0.39 % (14316)Instructions burned: 3 (million)
% 0.16/0.39 % (14316)------------------------------
% 0.16/0.39 % (14316)------------------------------
% 0.23/0.39 % (14315)Instruction limit reached!
% 0.23/0.39 % (14315)------------------------------
% 0.23/0.39 % (14315)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (14315)Termination reason: Unknown
% 0.23/0.39 % (14315)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (14315)Memory used [KB]: 5500
% 0.23/0.39 % (14315)Time elapsed: 0.006 s
% 0.23/0.39 % (14315)Instructions burned: 4 (million)
% 0.23/0.39 % (14315)------------------------------
% 0.23/0.39 % (14315)------------------------------
% 0.23/0.39 % (14320)First to succeed.
% 0.23/0.39 % (14317)Instruction limit reached!
% 0.23/0.39 % (14317)------------------------------
% 0.23/0.39 % (14317)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (14317)Termination reason: Unknown
% 0.23/0.39 % (14317)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (14317)Memory used [KB]: 5500
% 0.23/0.39 % (14317)Time elapsed: 0.005 s
% 0.23/0.39 % (14317)Instructions burned: 2 (million)
% 0.23/0.39 % (14317)------------------------------
% 0.23/0.39 % (14317)------------------------------
% 0.23/0.40 % (14314)Also succeeded, but the first one will report.
% 0.23/0.40 % (14320)Refutation found. Thanks to Tanya!
% 0.23/0.40 % SZS status Theorem for theBenchmark
% 0.23/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.40 % (14320)------------------------------
% 0.23/0.40 % (14320)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.40 % (14320)Termination reason: Refutation
% 0.23/0.40
% 0.23/0.40 % (14320)Memory used [KB]: 5500
% 0.23/0.40 % (14320)Time elapsed: 0.007 s
% 0.23/0.40 % (14320)Instructions burned: 4 (million)
% 0.23/0.40 % (14320)------------------------------
% 0.23/0.40 % (14320)------------------------------
% 0.23/0.40 % (14313)Success in time 0.021 s
% 0.23/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------