TSTP Solution File: SYO017^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO017^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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:14 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 376 ( 75 equ; 0 cnn)
% Maximal formula atoms : 5 ( 6 avg)
% Number of connectives : 261 ( 91 ~; 90 |; 0 &; 74 @)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 8 usr; 8 con; 0-2 aty)
% Number of variables : 1 ( 0 ^ 0 !; 0 ?; 1 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
h: $o > $o ).
thf(func_def_6,type,
ph1:
!>[X0: $tType] : X0 ).
thf(f142,plain,
$false,
inference(avatar_sat_refutation,[],[f17,f26,f48,f51,f68,f71,f84,f137,f141]) ).
thf(f141,plain,
( spl0_7
| ~ spl0_1
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f103,f23,f10,f129]) ).
thf(f129,plain,
( spl0_7
<=> ( ( h @ $true )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).
thf(f10,plain,
( spl0_1
<=> ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f23,plain,
( spl0_4
<=> ( ( h @ $false )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f103,plain,
( ( ( h @ $true )
= $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(equality_proxy_clausification,[],[f102]) ).
thf(f102,plain,
( ( ( ( h @ $true )
= $false )
!= $false )
| ~ spl0_1
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f98]) ).
thf(f98,plain,
( ( ( ( h @ $true )
= $false )
!= $false )
| ( $false = $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(constrained_superposition,[],[f87,f25]) ).
thf(f25,plain,
( ( ( h @ $false )
= $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f87,plain,
( ( ( h
@ ( ( h @ $true )
= $false ) )
= $true )
| ~ spl0_1
| ~ spl0_4 ),
inference(forward_demodulation,[],[f12,f25]) ).
thf(f12,plain,
( ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f10]) ).
thf(f137,plain,
( ~ spl0_7
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(avatar_split_clause,[],[f124,f43,f23,f10,f129]) ).
thf(f43,plain,
( spl0_6
<=> ( ( h @ $true )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).
thf(f124,plain,
( ( ( h @ $true )
!= $false )
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(equality_proxy_clausification,[],[f123]) ).
thf(f123,plain,
( ( ( ( h @ $true )
= $false )
!= $true )
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(trivial_inequality_removal,[],[f100]) ).
thf(f100,plain,
( ( ( ( h @ $true )
= $false )
!= $true )
| ( $true != $true )
| ~ spl0_1
| ~ spl0_4
| spl0_6 ),
inference(constrained_superposition,[],[f45,f87]) ).
thf(f45,plain,
( ( ( h @ $true )
!= $true )
| spl0_6 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f84,plain,
( spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f83]) ).
thf(f83,plain,
( $false
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(trivial_inequality_removal,[],[f82]) ).
thf(f82,plain,
( ( $false = $true )
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(equality_proxy_clausification,[],[f81]) ).
thf(f81,plain,
( ( ( $true = $false )
!= $false )
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(trivial_inequality_removal,[],[f80]) ).
thf(f80,plain,
( ( ( $true = $false )
!= $false )
| ( $false != $false )
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(constrained_superposition,[],[f73,f25]) ).
thf(f73,plain,
( ( ( h @ ( $true = $false ) )
!= $false )
| spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_demodulation,[],[f72,f25]) ).
thf(f72,plain,
( ( $false
!= ( h
@ ( $true
= ( h @ $false ) ) ) )
| spl0_3
| ~ spl0_6 ),
inference(forward_demodulation,[],[f20,f44]) ).
thf(f44,plain,
( ( ( h @ $true )
= $true )
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f43]) ).
thf(f20,plain,
( ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f19,plain,
( spl0_3
<=> ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f71,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f70]) ).
thf(f70,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f69]) ).
thf(f69,plain,
( ( $false = $true )
| ~ spl0_2
| ~ spl0_4 ),
inference(backward_demodulation,[],[f16,f25]) ).
thf(f16,plain,
( ( ( h @ $false )
= $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f14]) ).
thf(f14,plain,
( spl0_2
<=> ( ( h @ $false )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f68,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f67]) ).
thf(f67,plain,
( $false
| spl0_1
| ~ spl0_2
| ~ spl0_6 ),
inference(subsumption_resolution,[],[f66,f44]) ).
thf(f66,plain,
( ( ( h @ $true )
!= $true )
| spl0_1
| ~ spl0_2
| ~ spl0_6 ),
inference(boolean_simplification,[],[f65]) ).
thf(f65,plain,
( ( ( h @ ( $true = $true ) )
!= $true )
| spl0_1
| ~ spl0_2
| ~ spl0_6 ),
inference(forward_demodulation,[],[f64,f16]) ).
thf(f64,plain,
( ( ( h
@ ( $true
= ( h @ $false ) ) )
!= $true )
| spl0_1
| ~ spl0_6 ),
inference(forward_demodulation,[],[f11,f44]) ).
thf(f11,plain,
( ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= $true )
| spl0_1 ),
inference(avatar_component_clause,[],[f10]) ).
thf(f51,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f50]) ).
thf(f50,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f49]) ).
thf(f49,plain,
( ( $false = $true )
| ~ spl0_1
| ~ spl0_3 ),
inference(forward_demodulation,[],[f12,f21]) ).
thf(f21,plain,
( ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f19]) ).
thf(f48,plain,
( spl0_6
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_split_clause,[],[f33,f19,f14,f43]) ).
thf(f33,plain,
( ( ( h @ $true )
= $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(equality_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( ( ( h @ $true )
= $true )
!= $false )
| ~ spl0_2
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f31]) ).
thf(f31,plain,
( ( ( ( h @ $true )
= $true )
!= $false )
| ( $false = $true )
| ~ spl0_2
| ~ spl0_3 ),
inference(constrained_superposition,[],[f16,f27]) ).
thf(f27,plain,
( ( $false
= ( h
@ ( ( h @ $true )
= $true ) ) )
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f21,f16]) ).
thf(f26,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f8,f23,f19]) ).
thf(f8,plain,
( ( ( h @ $false )
= $false )
| ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f6]) ).
thf(f6,plain,
( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= ( h @ $false ) ),
inference(cnf_transformation,[],[f5]) ).
thf(f5,plain,
( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= ( h @ $false ) ),
inference(flattening,[],[f4]) ).
thf(f4,plain,
( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= ( h @ $false ) ),
inference(fool_elimination,[],[f2]) ).
thf(f2,negated_conjecture,
( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
!= ( h @ $false ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= ( h @ $false ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f17,plain,
( spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f7,f14,f10]) ).
thf(f7,plain,
( ( ( h
@ ( ( h @ $true )
= ( h @ $false ) ) )
= $true )
| ( ( h @ $false )
= $true ) ),
inference(binary_proxy_clausification,[],[f6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SYO017^1 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % 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.14/0.36 % Computer : n018.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:20:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 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/sandbox/benchmark/theBenchmark.p
% 0.14/0.39 % (11528)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.14/0.39 % (11529)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.14/0.39 % (11528)Refutation not found, incomplete strategy
% 0.14/0.39 % (11528)------------------------------
% 0.14/0.39 % (11528)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (11528)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (11528)Memory used [KB]: 5500
% 0.14/0.39 % (11528)Time elapsed: 0.005 s
% 0.14/0.39 % (11528)Instructions burned: 2 (million)
% 0.14/0.39 % (11528)------------------------------
% 0.14/0.39 % (11528)------------------------------
% 0.14/0.39 % (11533)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.39 % (11529)Refutation not found, incomplete strategy
% 0.14/0.39 % (11529)------------------------------
% 0.14/0.39 % (11529)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (11529)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (11529)Memory used [KB]: 5500
% 0.14/0.39 % (11529)Time elapsed: 0.003 s
% 0.14/0.39 % (11529)Instructions burned: 1 (million)
% 0.14/0.39 % (11529)------------------------------
% 0.14/0.39 % (11529)------------------------------
% 0.14/0.39 % (11527)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.14/0.39 % (11530)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.39 % (11532)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.14/0.39 % (11531)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.14/0.39 % (11534)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.14/0.39 % (11530)Instruction limit reached!
% 0.14/0.39 % (11530)------------------------------
% 0.14/0.39 % (11530)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (11530)Termination reason: Unknown
% 0.14/0.39 % (11530)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (11531)Instruction limit reached!
% 0.14/0.39 % (11531)------------------------------
% 0.14/0.39 % (11531)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (11531)Termination reason: Unknown
% 0.14/0.39 % (11531)Termination phase: Saturation
% 0.14/0.39
% 0.14/0.39 % (11531)Memory used [KB]: 5500
% 0.14/0.39 % (11531)Time elapsed: 0.004 s
% 0.14/0.39 % (11531)Instructions burned: 2 (million)
% 0.14/0.39 % (11531)------------------------------
% 0.14/0.39 % (11531)------------------------------
% 0.14/0.39 % (11530)Memory used [KB]: 5500
% 0.14/0.39 % (11530)Time elapsed: 0.004 s
% 0.14/0.39 % (11530)Instructions burned: 2 (million)
% 0.14/0.39 % (11530)------------------------------
% 0.14/0.39 % (11530)------------------------------
% 0.14/0.39 % (11532)Refutation not found, incomplete strategy
% 0.14/0.39 % (11532)------------------------------
% 0.14/0.39 % (11532)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (11532)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 % (11532)Memory used [KB]: 5500
% 0.14/0.39 % (11532)Time elapsed: 0.004 s
% 0.14/0.39 % (11532)Instructions burned: 1 (million)
% 0.14/0.39 % (11532)------------------------------
% 0.14/0.39 % (11532)------------------------------
% 0.14/0.40 % (11534)Refutation not found, incomplete strategy
% 0.14/0.40 % (11534)------------------------------
% 0.14/0.40 % (11534)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (11534)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 % (11534)Memory used [KB]: 5373
% 0.14/0.40 % (11534)Time elapsed: 0.004 s
% 0.14/0.40 % (11534)Instructions burned: 1 (million)
% 0.14/0.40 % (11534)------------------------------
% 0.14/0.40 % (11534)------------------------------
% 0.14/0.40 % (11533)First to succeed.
% 0.14/0.40 % (11533)Refutation found. Thanks to Tanya!
% 0.14/0.40 % SZS status Theorem for theBenchmark
% 0.14/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.40 % (11533)------------------------------
% 0.14/0.40 % (11533)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.40 % (11533)Termination reason: Refutation
% 0.14/0.40
% 0.14/0.40 % (11533)Memory used [KB]: 5500
% 0.14/0.40 % (11533)Time elapsed: 0.011 s
% 0.14/0.40 % (11533)Instructions burned: 6 (million)
% 0.14/0.40 % (11533)------------------------------
% 0.14/0.40 % (11533)------------------------------
% 0.14/0.40 % (11526)Success in time 0.019 s
% 0.14/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------