TSTP Solution File: SYO500^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO500^1 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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:05:30 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 71 ( 5 unt; 2 typ; 0 def)
% Number of atoms : 376 ( 58 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 295 ( 104 ~; 109 |; 0 &; 73 @)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 12 con; 0-2 aty)
% Number of variables : 1 ( 0 ^ 0 !; 0 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
f: $o > $o ).
thf(func_def_6,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f147,plain,
$false,
inference(avatar_sat_refutation,[],[f16,f25,f50,f60,f62,f65,f78,f81,f90,f127,f132,f136,f142]) ).
thf(f142,plain,
( ~ spl0_2
| spl0_5
| ~ spl0_7 ),
inference(avatar_contradiction_clause,[],[f141]) ).
thf(f141,plain,
( $false
| ~ spl0_2
| spl0_5
| ~ spl0_7 ),
inference(subsumption_resolution,[],[f140,f40]) ).
thf(f40,plain,
( ( ( f @ $true )
!= $true )
| spl0_5 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f38,plain,
( spl0_5
<=> ( ( f @ $true )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_5])]) ).
thf(f140,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_2
| ~ spl0_7 ),
inference(forward_demodulation,[],[f15,f49]) ).
thf(f49,plain,
( ( x = $true )
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f47]) ).
thf(f47,plain,
( spl0_7
<=> ( x = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f15,plain,
( ( ( f @ x )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f13]) ).
thf(f13,plain,
( spl0_2
<=> ( ( f @ x )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f136,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f135]) ).
thf(f135,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f134]) ).
thf(f134,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(forward_demodulation,[],[f15,f24]) ).
thf(f24,plain,
( ( ( f @ x )
= $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f22]) ).
thf(f22,plain,
( spl0_4
<=> ( ( f @ x )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f132,plain,
( ~ spl0_4
| spl0_6
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f131]) ).
thf(f131,plain,
( $false
| ~ spl0_4
| spl0_6
| ~ spl0_8 ),
inference(subsumption_resolution,[],[f129,f43]) ).
thf(f43,plain,
( ( ( f @ $false )
!= $false )
| spl0_6 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f42,plain,
( spl0_6
<=> ( ( f @ $false )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f129,plain,
( ( ( f @ $false )
= $false )
| ~ spl0_4
| ~ spl0_8 ),
inference(backward_demodulation,[],[f24,f54]) ).
thf(f54,plain,
( ( x = $false )
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f52]) ).
thf(f52,plain,
( spl0_8
<=> ( x = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_8])]) ).
thf(f127,plain,
( spl0_8
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f126,f42,f22,f9,f52]) ).
thf(f9,plain,
( spl0_1
<=> ( ( f @ ( f @ ( f @ x ) ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f126,plain,
( ( x = $false )
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(subsumption_resolution,[],[f111,f43]) ).
thf(f111,plain,
( ( ( f @ $false )
= $false )
| ( x = $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(binary_proxy_clausification,[],[f109]) ).
thf(f109,plain,
( ( x
!= ( f @ $false ) )
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f105]) ).
thf(f105,plain,
( ( x
!= ( f @ $false ) )
| ( $false = $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(constrained_superposition,[],[f82,f24]) ).
thf(f82,plain,
( ( ( f @ ( f @ $false ) )
= $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f11,f24]) ).
thf(f11,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f9]) ).
thf(f90,plain,
( spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f89]) ).
thf(f89,plain,
( $false
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f88,f44]) ).
thf(f44,plain,
( ( ( f @ $false )
= $false )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f42]) ).
thf(f88,plain,
( ( ( f @ $false )
!= $false )
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_demodulation,[],[f87,f44]) ).
thf(f87,plain,
( ( $false
!= ( f @ ( f @ $false ) ) )
| spl0_3
| ~ spl0_4 ),
inference(forward_demodulation,[],[f19,f24]) ).
thf(f19,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
!= $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f18,plain,
( spl0_3
<=> ( ( f @ ( f @ ( f @ x ) ) )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f81,plain,
( ~ spl0_5
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f80]) ).
thf(f80,plain,
( $false
| ~ spl0_5
| ~ spl0_9 ),
inference(trivial_inequality_removal,[],[f79]) ).
thf(f79,plain,
( ( $false = $true )
| ~ spl0_5
| ~ spl0_9 ),
inference(backward_demodulation,[],[f39,f58]) ).
thf(f58,plain,
( ( ( f @ $true )
= $false )
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f56]) ).
thf(f56,plain,
( spl0_9
<=> ( ( f @ $true )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_9])]) ).
thf(f39,plain,
( ( ( f @ $true )
= $true )
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f38]) ).
thf(f78,plain,
( spl0_9
| ~ spl0_2
| ~ spl0_3
| ~ spl0_5 ),
inference(avatar_split_clause,[],[f77,f38,f18,f13,f56]) ).
thf(f77,plain,
( ( ( f @ $true )
= $false )
| ~ spl0_2
| ~ spl0_3
| ~ spl0_5 ),
inference(forward_demodulation,[],[f76,f39]) ).
thf(f76,plain,
( ( $false
= ( f @ ( f @ $true ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(backward_demodulation,[],[f20,f15]) ).
thf(f20,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f18]) ).
thf(f65,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f64]) ).
thf(f64,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f63]) ).
thf(f63,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_3 ),
inference(backward_demodulation,[],[f11,f20]) ).
thf(f62,plain,
( spl0_8
| spl0_9
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f33,f18,f13,f56,f52]) ).
thf(f33,plain,
( ( ( f @ $true )
= $false )
| ( x = $false )
| ~ spl0_2
| ~ spl0_3 ),
inference(binary_proxy_clausification,[],[f31]) ).
thf(f31,plain,
( ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f29,plain,
( ( $false = $true )
| ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(constrained_superposition,[],[f26,f15]) ).
thf(f26,plain,
( ( $false
= ( f @ ( f @ $true ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f20,f15]) ).
thf(f60,plain,
( ~ spl0_7
| spl0_9
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f28,f18,f13,f56,f47]) ).
thf(f28,plain,
( ( x != $true )
| ( ( f @ $true )
= $false )
| ~ spl0_2
| ~ spl0_3 ),
inference(constrained_superposition,[],[f26,f15]) ).
thf(f50,plain,
( spl0_5
| spl0_7
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f35,f18,f13,f47,f38]) ).
thf(f35,plain,
( ( x = $true )
| ( ( f @ $true )
= $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(binary_proxy_clausification,[],[f34]) ).
thf(f34,plain,
( ( x
!= ( f @ $true ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f30]) ).
thf(f30,plain,
( ( x
!= ( f @ $true ) )
| ( $false = $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(constrained_superposition,[],[f15,f26]) ).
thf(f25,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f7,f22,f18]) ).
thf(f7,plain,
( ( ( f @ ( f @ ( f @ x ) ) )
= $false )
| ( ( f @ x )
= $false ) ),
inference(binary_proxy_clausification,[],[f5]) ).
thf(f5,plain,
( ( f @ x )
!= ( f @ ( f @ ( f @ x ) ) ) ),
inference(cnf_transformation,[],[f4]) ).
thf(f4,plain,
( ( f @ x )
!= ( f @ ( f @ ( f @ x ) ) ) ),
inference(flattening,[],[f2]) ).
thf(f2,negated_conjecture,
( ( f @ x )
!= ( f @ ( f @ ( f @ x ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( f @ x )
= ( f @ ( f @ ( f @ x ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
thf(f16,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f6,f13,f9]) ).
thf(f6,plain,
( ( ( f @ x )
= $true )
| ( ( f @ ( f @ ( f @ x ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO500^1 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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 : n022.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 09:14:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 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.37 % (24987)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.37 % (24990)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (24988)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.37 % (24991)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.37 % (24989)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.37 % (24993)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.37 % (24991)Refutation not found, incomplete strategy
% 0.14/0.37 % (24991)------------------------------
% 0.14/0.37 % (24991)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24991)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (24991)Memory used [KB]: 5500
% 0.14/0.37 % (24991)Time elapsed: 0.003 s
% 0.14/0.37 % (24990)Refutation not found, incomplete strategy
% 0.14/0.37 % (24990)------------------------------
% 0.14/0.37 % (24990)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24991)Instructions burned: 1 (million)
% 0.14/0.37 % (24991)------------------------------
% 0.14/0.37 % (24991)------------------------------
% 0.14/0.37 % (24990)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (24990)Memory used [KB]: 5500
% 0.14/0.37 % (24990)Time elapsed: 0.003 s
% 0.14/0.37 % (24990)Instructions burned: 1 (million)
% 0.14/0.37 % (24989)Refutation not found, incomplete strategy
% 0.14/0.37 % (24989)------------------------------
% 0.14/0.37 % (24989)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (24990)------------------------------
% 0.14/0.37 % (24990)------------------------------
% 0.14/0.37 % (24989)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (24989)Memory used [KB]: 5500
% 0.14/0.37 % (24989)Time elapsed: 0.004 s
% 0.14/0.37 % (24989)Instructions burned: 2 (million)
% 0.14/0.37 % (24989)------------------------------
% 0.14/0.37 % (24989)------------------------------
% 0.14/0.38 % (24988)Instruction limit reached!
% 0.14/0.38 % (24988)------------------------------
% 0.14/0.38 % (24988)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (24988)Termination reason: Unknown
% 0.14/0.38 % (24988)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (24988)Memory used [KB]: 5500
% 0.14/0.38 % (24988)Time elapsed: 0.006 s
% 0.14/0.38 % (24988)Instructions burned: 5 (million)
% 0.14/0.38 % (24988)------------------------------
% 0.14/0.38 % (24988)------------------------------
% 0.14/0.38 % (24994)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 % (24993)First to succeed.
% 0.14/0.38 % (24994)Refutation not found, incomplete strategy
% 0.14/0.38 % (24994)------------------------------
% 0.14/0.38 % (24994)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (24994)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (24994)Memory used [KB]: 5373
% 0.14/0.38 % (24994)Time elapsed: 0.003 s
% 0.14/0.38 % (24994)Instructions burned: 1 (million)
% 0.14/0.38 % (24994)------------------------------
% 0.14/0.38 % (24994)------------------------------
% 0.14/0.38 % (24993)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38 % (24993)------------------------------
% 0.14/0.38 % (24993)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (24993)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (24993)Memory used [KB]: 5500
% 0.14/0.38 % (24993)Time elapsed: 0.008 s
% 0.14/0.38 % (24993)Instructions burned: 7 (million)
% 0.14/0.38 % (24993)------------------------------
% 0.14/0.38 % (24993)------------------------------
% 0.14/0.38 % (24986)Success in time 0.031 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------