TSTP Solution File: SYO024^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO024^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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:16 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 23 unt; 3 typ; 0 def)
% Number of atoms : 228 ( 66 equ; 15 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 217 ( 89 ~; 49 |; 22 &; 45 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 62 ( 62 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 5 usr; 6 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 48 ( 45 ^ 2 !; 0 ?; 48 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
leibeq: ( $o > $o > $o ) > ( $o > $o > $o ) > $o ).
thf(func_def_14,type,
sK1: ( $o > $o > $o ) > $o ).
thf(func_def_15,type,
ph2:
!>[X0: $tType] : X0 ).
thf(f56,plain,
$false,
inference(trivial_inequality_removal,[],[f55]) ).
thf(f55,plain,
$true = $false,
inference(backward_demodulation,[],[f48,f54]) ).
thf(f54,plain,
sK4 = $false,
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
( ( $true = $false )
| ( sK4 = $false ) ),
inference(forward_demodulation,[],[f34,f41]) ).
thf(f41,plain,
sK3 = $true,
inference(duplicate_literal_removal,[],[f40]) ).
thf(f40,plain,
( ( sK3 = $true )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[],[f39]) ).
thf(f39,plain,
( ( $false = ~ sK3 )
| ( sK3 = $true ) ),
inference(binary_proxy_clausification,[],[f37]) ).
thf(f37,plain,
( ( $false
= ( ~ sK3
| ~ sK4 ) )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[],[f36]) ).
thf(f36,plain,
( ( sK3 = $true )
| ( ( ~ ( ~ sK3
| ~ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f26]) ).
thf(f26,plain,
( ( ( sK3
& sK4 )
= $true )
| ( ( ~ ( ~ sK3
| ~ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( ~ ( ~ sK3
| ~ sK4 ) )
!= ( sK3
& sK4 ) ),
inference(beta_eta_normalization,[],[f24]) ).
thf(f24,plain,
( ( sK3
& sK4 )
!= ( ^ [Y0: $o] :
~ ( ~ sK3
| ~ Y0 )
@ sK4 ) ),
inference(negative_extensionality,[],[f23]) ).
thf(f23,plain,
( ( ^ [Y0: $o] :
~ ( ~ sK3
| ~ Y0 ) )
!= ( (&) @ sK3 ) ),
inference(beta_eta_normalization,[],[f22]) ).
thf(f22,plain,
( ( (&) @ sK3 )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 )
@ sK3 ) ),
inference(negative_extensionality,[],[f21]) ).
thf(f21,plain,
( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
( ( (&)
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) )
| ( $true = $false ) ),
inference(constrained_superposition,[],[f16,f17]) ).
thf(f17,plain,
( ( sK1 @ (&) )
= $true ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( sK1 @ (&) )
=> ( sK1
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) )
= $false ),
inference(beta_eta_normalization,[],[f14]) ).
thf(f14,plain,
( ( ^ [Y0: ( $o > $o > $o ) > $o] :
( ( Y0 @ (&) )
=> ( Y0
@ ^ [Y1: $o,Y2: $o] :
~ ( ~ Y1
| ~ Y2 ) ) )
@ sK1 )
= $false ),
inference(sigma_clausification,[],[f13]) ).
thf(f13,plain,
( ( !! @ ( ( $o > $o > $o ) > $o )
@ ^ [Y0: ( $o > $o > $o ) > $o] :
( ( Y0 @ (&) )
=> ( Y0
@ ^ [Y1: $o,Y2: $o] :
~ ( ~ Y1
| ~ Y2 ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f12]) ).
thf(f12,plain,
( $true
!= ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
( !! @ ( ( $o > $o > $o ) > $o )
@ ^ [Y2: ( $o > $o > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ (&)
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(definition_unfolding,[],[f11,f10]) ).
thf(f10,plain,
( leibeq
= ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
( !! @ ( ( $o > $o > $o ) > $o )
@ ^ [Y2: ( $o > $o > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( leibeq
= ( ^ [Y0: $o > $o > $o,Y1: $o > $o > $o] :
( !! @ ( ( $o > $o > $o ) > $o )
@ ^ [Y2: ( $o > $o > $o ) > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
( ( ^ [X0: $o > $o > $o,X1: $o > $o > $o] :
! [X2: ( $o > $o > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $o > $o > $o,X1: $o > $o > $o] :
! [X2: ( $o > $o > $o ) > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq) ).
thf(f11,plain,
( ( leibeq @ (&)
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) )
!= $true ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( ( leibeq @ (&)
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) )
!= $true ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
( ( leibeq @ (&)
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) )
!= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ( leibeq @ (&)
@ ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ( leibeq @ (&)
@ ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
( leibeq @ (&)
@ ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f16,plain,
( ( sK1
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) )
= $false ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f34,plain,
( ( sK4 = $false )
| ( sK3 = $false ) ),
inference(duplicate_literal_removal,[],[f33]) ).
thf(f33,plain,
( ( sK4 = $false )
| ( sK3 = $false )
| ( sK3 = $false ) ),
inference(not_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( sK4 = $false )
| ( $true = ~ sK3 )
| ( sK3 = $false ) ),
inference(duplicate_literal_removal,[],[f31]) ).
thf(f31,plain,
( ( sK3 = $false )
| ( sK4 = $false )
| ( $true = ~ sK3 )
| ( sK4 = $false ) ),
inference(binary_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( ( sK3
& sK4 )
= $false )
| ( $true = ~ sK3 )
| ( sK4 = $false ) ),
inference(not_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( ~ sK4 = $true )
| ( $true = ~ sK3 )
| ( ( sK3
& sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( ( $true
= ( ~ sK3
| ~ sK4 ) )
| ( ( sK3
& sK4 )
= $false ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( ( ~ ( ~ sK3
| ~ sK4 ) )
= $false )
| ( ( sK3
& sK4 )
= $false ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f48,plain,
sK4 = $true,
inference(duplicate_literal_removal,[],[f47]) ).
thf(f47,plain,
( ( sK4 = $true )
| ( sK4 = $true ) ),
inference(not_proxy_clausification,[],[f44]) ).
thf(f44,plain,
( ( sK4 = $true )
| ( ~ sK4 = $false ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( $false
= ( ~ sK3
| ~ sK4 ) )
| ( sK4 = $true ) ),
inference(not_proxy_clausification,[],[f35]) ).
thf(f35,plain,
( ( sK4 = $true )
| ( ( ~ ( ~ sK3
| ~ sK4 ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO024^1 : TPTP v8.2.0. Released v3.7.0.
% 0.03/0.13 % 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.12/0.35 % Computer : n013.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Mon May 20 10:06:53 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/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.20/0.37 % (28552)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.20/0.37 % (28553)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.20/0.37 % (28554)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.20/0.37 % (28555)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.37 % (28556)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.20/0.37 % (28558)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.37 % (28557)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.20/0.37 % (28559)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.20/0.37 % (28555)Instruction limit reached!
% 0.20/0.37 % (28555)------------------------------
% 0.20/0.37 % (28555)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28555)Termination reason: Unknown
% 0.20/0.37 % (28555)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (28556)Instruction limit reached!
% 0.20/0.37 % (28556)------------------------------
% 0.20/0.37 % (28556)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28556)Termination reason: Unknown
% 0.20/0.37 % (28556)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (28556)Memory used [KB]: 5373
% 0.20/0.37 % (28556)Time elapsed: 0.003 s
% 0.20/0.37 % (28556)Instructions burned: 2 (million)
% 0.20/0.37 % (28556)------------------------------
% 0.20/0.37 % (28556)------------------------------
% 0.20/0.37 % (28555)Memory used [KB]: 5373
% 0.20/0.37 % (28555)Time elapsed: 0.003 s
% 0.20/0.37 % (28555)Instructions burned: 2 (million)
% 0.20/0.37 % (28555)------------------------------
% 0.20/0.37 % (28555)------------------------------
% 0.20/0.37 % (28557)Refutation not found, incomplete strategy
% 0.20/0.37 % (28557)------------------------------
% 0.20/0.37 % (28557)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28557)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (28557)Memory used [KB]: 5373
% 0.20/0.37 % (28557)Time elapsed: 0.003 s
% 0.20/0.37 % (28557)Instructions burned: 1 (million)
% 0.20/0.37 % (28557)------------------------------
% 0.20/0.37 % (28557)------------------------------
% 0.20/0.37 % (28554)Refutation not found, incomplete strategy
% 0.20/0.37 % (28554)------------------------------
% 0.20/0.37 % (28554)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28554)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (28554)Memory used [KB]: 5500
% 0.20/0.37 % (28554)Time elapsed: 0.003 s
% 0.20/0.37 % (28554)Instructions burned: 2 (million)
% 0.20/0.37 % (28554)------------------------------
% 0.20/0.37 % (28554)------------------------------
% 0.20/0.37 % (28553)Refutation not found, incomplete strategy
% 0.20/0.37 % (28553)------------------------------
% 0.20/0.37 % (28553)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28553)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (28553)Memory used [KB]: 5500
% 0.20/0.37 % (28553)Time elapsed: 0.004 s
% 0.20/0.37 % (28553)Instructions burned: 2 (million)
% 0.20/0.37 % (28559)Refutation not found, incomplete strategy
% 0.20/0.37 % (28559)------------------------------
% 0.20/0.37 % (28559)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28559)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.37
% 0.20/0.37
% 0.20/0.37 % (28559)Memory used [KB]: 5373
% 0.20/0.37 % (28559)Time elapsed: 0.002 s
% 0.20/0.37 % (28559)Instructions burned: 2 (million)
% 0.20/0.37 % (28559)------------------------------
% 0.20/0.37 % (28559)------------------------------
% 0.20/0.37 % (28553)------------------------------
% 0.20/0.37 % (28553)------------------------------
% 0.20/0.37 % (28558)First to succeed.
% 0.20/0.37 % (28552)Also succeeded, but the first one will report.
% 0.20/0.37 % (28558)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (28558)------------------------------
% 0.20/0.37 % (28558)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (28558)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (28558)Memory used [KB]: 5500
% 0.20/0.37 % (28558)Time elapsed: 0.005 s
% 0.20/0.37 % (28558)Instructions burned: 3 (million)
% 0.20/0.37 % (28558)------------------------------
% 0.20/0.37 % (28558)------------------------------
% 0.20/0.37 % (28551)Success in time 0.016 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------