TSTP Solution File: SYO042^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO042^2 : TPTP v8.2.0. Released v4.1.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 09:02:25 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 85 ( 10 unt; 3 typ; 0 def)
% Number of atoms : 459 ( 90 equ; 8 cnn)
% Maximal formula atoms : 7 ( 5 avg)
% Number of connectives : 322 ( 125 ~; 105 |; 20 &; 62 @)
% ( 10 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 16 usr; 16 con; 0-2 aty)
% Number of variables : 1 ( 0 ^ 0 !; 0 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
g: $o > $o ).
thf(func_def_1,type,
p: ( $o > $o ) > $o ).
thf(func_def_9,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f356,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f35,f40,f45,f62,f71,f84,f92,f99,f106,f165,f204,f355]) ).
thf(f355,plain,
( ~ spl0_4
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f354]) ).
thf(f354,plain,
( $false
| ~ spl0_4
| ~ spl0_6
| ~ spl0_8
| ~ spl0_9 ),
inference(subsumption_resolution,[],[f300,f44]) ).
thf(f44,plain,
( ( ( g @ y )
= $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f42,plain,
( spl0_6
<=> ( ( g @ y )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f300,plain,
( ( ( g @ y )
!= $false )
| ~ spl0_4
| ~ spl0_8
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f286]) ).
thf(f286,plain,
( ( ( g @ y )
!= $false )
| ( $true = $false )
| ~ spl0_4
| ~ spl0_8
| ~ spl0_9 ),
inference(constrained_superposition,[],[f34,f233]) ).
thf(f233,plain,
( ( ( g @ $false )
= $false )
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f66,f61]) ).
thf(f61,plain,
( ( sK2 = $false )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f59,plain,
( spl0_8
<=> ( sK2 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f66,plain,
( ( $false
= ( g @ sK2 ) )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f64,plain,
( spl0_9
<=> ( $false
= ( g @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f34,plain,
( ( $true
= ( g @ ( g @ y ) ) )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f32,plain,
( spl0_4
<=> ( $true
= ( g @ ( g @ y ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f204,plain,
( spl0_3
| ~ spl0_6
| spl0_8
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f203]) ).
thf(f203,plain,
( $false
| spl0_3
| ~ spl0_6
| spl0_8
| spl0_9 ),
inference(subsumption_resolution,[],[f202,f29]) ).
thf(f29,plain,
( ( y != $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f28,plain,
( spl0_3
<=> ( y = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f202,plain,
( ( y = $false )
| ~ spl0_6
| spl0_8
| spl0_9 ),
inference(subsumption_resolution,[],[f189,f60]) ).
thf(f60,plain,
( ( sK2 != $false )
| spl0_8 ),
inference(avatar_component_clause,[],[f59]) ).
thf(f189,plain,
( ( sK2 = $false )
| ( y = $false )
| ~ spl0_6
| spl0_9 ),
inference(binary_proxy_clausification,[],[f187]) ).
thf(f187,plain,
( ( y != sK2 )
| ~ spl0_6
| spl0_9 ),
inference(trivial_inequality_removal,[],[f180]) ).
thf(f180,plain,
( ( $false != $false )
| ( y != sK2 )
| ~ spl0_6
| spl0_9 ),
inference(constrained_superposition,[],[f65,f44]) ).
thf(f65,plain,
( ( $false
!= ( g @ sK2 ) )
| spl0_9 ),
inference(avatar_component_clause,[],[f64]) ).
thf(f165,plain,
( ~ spl0_2
| ~ spl0_5
| ~ spl0_7
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f164]) ).
thf(f164,plain,
( $false
| ~ spl0_2
| ~ spl0_5
| ~ spl0_7
| ~ spl0_10 ),
inference(subsumption_resolution,[],[f140,f39]) ).
thf(f39,plain,
( ( ( g @ y )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f37]) ).
thf(f37,plain,
( spl0_5
<=> ( ( g @ y )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f140,plain,
( ( ( g @ y )
!= $true )
| ~ spl0_2
| ~ spl0_7
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f131]) ).
thf(f131,plain,
( ( $true = $false )
| ( ( g @ y )
!= $true )
| ~ spl0_2
| ~ spl0_7
| ~ spl0_10 ),
inference(constrained_superposition,[],[f109,f25]) ).
thf(f25,plain,
( ( ( g @ ( g @ y ) )
= $false )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl0_2
<=> ( ( g @ ( g @ y ) )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f109,plain,
( ( ( g @ $true )
= $true )
| ~ spl0_7
| ~ spl0_10 ),
inference(superposition,[],[f57,f70]) ).
thf(f70,plain,
( ( $true = sK2 )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f68]) ).
thf(f68,plain,
( spl0_10
<=> ( $true = sK2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_10])]) ).
thf(f57,plain,
( ( $true
= ( g @ sK2 ) )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f55]) ).
thf(f55,plain,
( spl0_7
<=> ( $true
= ( g @ sK2 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f106,plain,
( ~ spl0_8
| ~ spl0_10 ),
inference(avatar_contradiction_clause,[],[f105]) ).
thf(f105,plain,
( $false
| ~ spl0_8
| ~ spl0_10 ),
inference(trivial_inequality_removal,[],[f102]) ).
thf(f102,plain,
( ( $true = $false )
| ~ spl0_8
| ~ spl0_10 ),
inference(superposition,[],[f61,f70]) ).
thf(f99,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f98]) ).
thf(f98,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f95]) ).
thf(f95,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f30,f21]) ).
thf(f21,plain,
( ( y = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl0_1
<=> ( y = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f30,plain,
( ( y = $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f28]) ).
thf(f92,plain,
( ~ spl0_8
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(avatar_split_clause,[],[f85,f64,f37,f28,f59]) ).
thf(f85,plain,
( ( sK2 != $false )
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f76]) ).
thf(f76,plain,
( ( sK2 != $false )
| ( $true = $false )
| ~ spl0_3
| ~ spl0_5
| ~ spl0_9 ),
inference(constrained_superposition,[],[f46,f66]) ).
thf(f46,plain,
( ( ( g @ $false )
= $true )
| ~ spl0_3
| ~ spl0_5 ),
inference(superposition,[],[f39,f30]) ).
thf(f84,plain,
( ~ spl0_7
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| ~ spl0_7
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f72]) ).
thf(f72,plain,
( ( $true = $false )
| ~ spl0_7
| ~ spl0_9 ),
inference(superposition,[],[f66,f57]) ).
thf(f71,plain,
( spl0_9
| spl0_10 ),
inference(avatar_split_clause,[],[f52,f68,f64]) ).
thf(f52,plain,
( ( $true = sK2 )
| ( $false
= ( g @ sK2 ) ) ),
inference(not_proxy_clausification,[],[f51]) ).
thf(f51,plain,
( ( $false = ~ sK2 )
| ( $false
= ( g @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f49]) ).
thf(f49,plain,
( ( g @ sK2 )
!= ~ sK2 ),
inference(negative_extensionality,[],[f48]) ).
thf(f48,plain,
g != (~),
inference(trivial_inequality_removal,[],[f47]) ).
thf(f47,plain,
( ( $true != $true )
| ( g != (~) ) ),
inference(constrained_superposition,[],[f10,f9]) ).
thf(f9,plain,
( ( p @ g )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( ( y
= ( g @ x ) )
& ( ( p @ (~) )
!= $true )
& ( ( p @ g )
= $true )
& ( x
= ( g @ y ) )
& ( x != y ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ~ ( ( x != y )
& ( ( p @ (~) )
!= $true )
& ( x
= ( g @ y ) )
& ( y
= ( g @ x ) )
& ( ( p @ g )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ~ ( ( x != y )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( y
= ( g @ x ) )
& ( p @ g ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ~ ( ( x != y )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( y
= ( g @ x ) )
& ( p @ g ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
~ ( ( x != y )
& ~ ( p @ (~) )
& ( x
= ( g @ y ) )
& ( y
= ( g @ x ) )
& ( p @ g ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',4) ).
thf(f10,plain,
( ( p @ (~) )
!= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f62,plain,
( spl0_7
| spl0_8 ),
inference(avatar_split_clause,[],[f53,f59,f55]) ).
thf(f53,plain,
( ( $true
= ( g @ sK2 ) )
| ( sK2 = $false ) ),
inference(not_proxy_clausification,[],[f50]) ).
thf(f50,plain,
( ( $true = ~ sK2 )
| ( $true
= ( g @ sK2 ) ) ),
inference(binary_proxy_clausification,[],[f49]) ).
thf(f45,plain,
( spl0_6
| spl0_3 ),
inference(avatar_split_clause,[],[f15,f28,f42]) ).
thf(f15,plain,
( ( y = $false )
| ( ( g @ y )
= $false ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
( y
!= ( g @ y ) ),
inference(definition_unfolding,[],[f7,f8]) ).
thf(f8,plain,
( x
= ( g @ y ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f7,plain,
x != y,
inference(cnf_transformation,[],[f6]) ).
thf(f40,plain,
( spl0_5
| spl0_1 ),
inference(avatar_split_clause,[],[f14,f19,f37]) ).
thf(f14,plain,
( ( ( g @ y )
= $true )
| ( y = $true ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f35,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f17,f32,f28]) ).
thf(f17,plain,
( ( $true
= ( g @ ( g @ y ) ) )
| ( y = $false ) ),
inference(binary_proxy_clausification,[],[f12]) ).
thf(f12,plain,
( y
= ( g @ ( g @ y ) ) ),
inference(definition_unfolding,[],[f11,f8]) ).
thf(f11,plain,
( y
= ( g @ x ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f26,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f16,f23,f19]) ).
thf(f16,plain,
( ( y = $true )
| ( ( g @ ( g @ y ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO042^2 : TPTP v8.2.0. Released v4.1.0.
% 0.07/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.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 08:51:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.38 % (8558)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.14/0.38 % (8560)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.14/0.38 % (8561)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (8559)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.14/0.38 % (8562)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 (3000ds/2Mi)
% 0.14/0.38 % (8563)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.14/0.38 % (8564)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.14/0.38 % (8565)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.14/0.38 % (8561)Instruction limit reached!
% 0.14/0.38 % (8561)------------------------------
% 0.14/0.38 % (8561)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8561)Termination reason: Unknown
% 0.14/0.38 % (8561)Termination phase: Saturation
% 0.14/0.38 % (8562)Instruction limit reached!
% 0.14/0.38 % (8562)------------------------------
% 0.14/0.38 % (8562)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8562)Termination reason: Unknown
% 0.14/0.38 % (8562)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (8562)Memory used [KB]: 5500
% 0.14/0.38 % (8562)Time elapsed: 0.004 s
% 0.14/0.38 % (8562)Instructions burned: 2 (million)
% 0.14/0.38 % (8562)------------------------------
% 0.14/0.38 % (8562)------------------------------
% 0.14/0.38
% 0.14/0.38 % (8561)Memory used [KB]: 5500
% 0.14/0.38 % (8561)Time elapsed: 0.004 s
% 0.14/0.38 % (8561)Instructions burned: 2 (million)
% 0.14/0.38 % (8561)------------------------------
% 0.14/0.38 % (8561)------------------------------
% 0.14/0.38 % (8563)Refutation not found, incomplete strategy
% 0.14/0.38 % (8563)------------------------------
% 0.14/0.38 % (8563)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8563)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8560)Refutation not found, incomplete strategy
% 0.14/0.38 % (8560)------------------------------
% 0.14/0.38 % (8560)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8560)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8560)Memory used [KB]: 5500
% 0.14/0.38 % (8560)Time elapsed: 0.004 s
% 0.14/0.38 % (8560)Instructions burned: 2 (million)
% 0.14/0.38 % (8560)------------------------------
% 0.14/0.38 % (8560)------------------------------
% 0.14/0.38 % (8563)Memory used [KB]: 5500
% 0.14/0.38 % (8563)Time elapsed: 0.004 s
% 0.14/0.38 % (8563)Instructions burned: 2 (million)
% 0.14/0.38 % (8563)------------------------------
% 0.14/0.38 % (8563)------------------------------
% 0.14/0.38 % (8559)Refutation not found, incomplete strategy
% 0.14/0.38 % (8559)------------------------------
% 0.14/0.38 % (8559)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8565)Refutation not found, incomplete strategy
% 0.14/0.38 % (8565)------------------------------
% 0.14/0.38 % (8565)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8565)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8565)Memory used [KB]: 5500
% 0.14/0.38 % (8565)Time elapsed: 0.003 s
% 0.14/0.38 % (8565)Instructions burned: 2 (million)
% 0.14/0.38 % (8565)------------------------------
% 0.14/0.38 % (8565)------------------------------
% 0.14/0.38 % (8559)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8559)Memory used [KB]: 5500
% 0.14/0.38 % (8559)Time elapsed: 0.004 s
% 0.14/0.38 % (8559)Instructions burned: 3 (million)
% 0.14/0.38 % (8559)------------------------------
% 0.14/0.38 % (8559)------------------------------
% 0.14/0.38 % (8564)Refutation not found, incomplete strategy
% 0.14/0.38 % (8564)------------------------------
% 0.14/0.38 % (8564)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (8564)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (8564)Memory used [KB]: 5500
% 0.14/0.38 % (8564)Time elapsed: 0.005 s
% 0.14/0.38 % (8564)Instructions burned: 3 (million)
% 0.14/0.38 % (8564)------------------------------
% 0.14/0.38 % (8564)------------------------------
% 0.14/0.38 % (8558)First to succeed.
% 0.14/0.39 % (8558)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.39 % (8558)------------------------------
% 0.14/0.39 % (8558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (8558)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (8558)Memory used [KB]: 5628
% 0.14/0.39 % (8558)Time elapsed: 0.013 s
% 0.14/0.39 % (8558)Instructions burned: 11 (million)
% 0.14/0.39 % (8558)------------------------------
% 0.14/0.39 % (8558)------------------------------
% 0.14/0.39 % (8557)Success in time 0.023 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------