TSTP Solution File: SYO022^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO022^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 : n009.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:15 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 9
% Syntax : Number of formulae : 62 ( 26 unt; 3 typ; 0 def)
% Number of atoms : 259 ( 73 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 252 ( 106 ~; 65 |; 20 &; 45 @)
% ( 4 <=>; 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 : 13 ( 9 usr; 9 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 78 ( 75 ^ 2 !; 0 ?; 78 :)
% ( 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(f82,plain,
$false,
inference(avatar_sat_refutation,[],[f58,f59,f69,f75,f81]) ).
thf(f81,plain,
( ~ spl0_1
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f80]) ).
thf(f80,plain,
( $false
| ~ spl0_1
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f77]) ).
thf(f77,plain,
( ( $true = $false )
| ~ spl0_1
| ~ spl0_3 ),
inference(superposition,[],[f52,f64]) ).
thf(f64,plain,
( ( sK4 = $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f62]) ).
thf(f62,plain,
( spl0_3
<=> ( sK4 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f52,plain,
( ( sK4 = $true )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl0_1
<=> ( sK4 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f75,plain,
( ~ spl0_2
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f74]) ).
thf(f74,plain,
( $false
| ~ spl0_2
| ~ spl0_4 ),
inference(trivial_inequality_removal,[],[f70]) ).
thf(f70,plain,
( ( $true = $false )
| ~ spl0_2
| ~ spl0_4 ),
inference(superposition,[],[f56,f68]) ).
thf(f68,plain,
( ( sK3 = $false )
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f66]) ).
thf(f66,plain,
( spl0_4
<=> ( sK3 = $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).
thf(f56,plain,
( ( sK3 = $true )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f54]) ).
thf(f54,plain,
( spl0_2
<=> ( sK3 = $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f69,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f34,f66,f62]) ).
thf(f34,plain,
( ( sK3 = $false )
| ( sK4 = $false ) ),
inference(duplicate_literal_removal,[],[f33]) ).
thf(f33,plain,
( ( sK3 = $false )
| ( sK3 = $false )
| ( sK4 = $false ) ),
inference(not_proxy_clausification,[],[f32]) ).
thf(f32,plain,
( ( $true = ~ sK3 )
| ( sK3 = $false )
| ( sK4 = $false ) ),
inference(duplicate_literal_removal,[],[f31]) ).
thf(f31,plain,
( ( sK3 = $false )
| ( sK4 = $false )
| ( $true = ~ sK3 )
| ( sK4 = $false ) ),
inference(not_proxy_clausification,[],[f30]) ).
thf(f30,plain,
( ( ~ sK4 = $true )
| ( $true = ~ sK3 )
| ( sK4 = $false )
| ( sK3 = $false ) ),
inference(binary_proxy_clausification,[],[f29]) ).
thf(f29,plain,
( ( sK4 = $false )
| ( sK3 = $false )
| ( ( ~ sK3
| ~ sK4 )
= $true ) ),
inference(binary_proxy_clausification,[],[f28]) ).
thf(f28,plain,
( ( ( sK4
& sK3 )
= $false )
| ( ( ~ sK3
| ~ sK4 )
= $true ) ),
inference(not_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( $false
= ( ~ ( ~ sK3
| ~ sK4 ) ) )
| ( ( sK4
& sK3 )
= $false ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f25,plain,
( ( sK4
& sK3 )
!= ( ~ ( ~ sK3
| ~ sK4 ) ) ),
inference(beta_eta_normalization,[],[f24]) ).
thf(f24,plain,
( ( ^ [Y0: $o] :
~ ( ~ sK3
| ~ Y0 )
@ sK4 )
!= ( ^ [Y0: $o] :
( Y0
& sK3 )
@ sK4 ) ),
inference(negative_extensionality,[],[f23]) ).
thf(f23,plain,
( ( ^ [Y0: $o] :
( Y0
& sK3 ) )
!= ( ^ [Y0: $o] :
~ ( ~ sK3
| ~ Y0 ) ) ),
inference(beta_eta_normalization,[],[f22]) ).
thf(f22,plain,
( ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 )
@ sK3 )
!= ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 )
@ sK3 ) ),
inference(negative_extensionality,[],[f21]) ).
thf(f21,plain,
( ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
( ( $true = $false )
| ( ( ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
!= ( ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ) ),
inference(constrained_superposition,[],[f17,f16]) ).
thf(f16,plain,
( ( sK1
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) )
= $false ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ( sK1
@ ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) )
=> ( sK1
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) )
= $false ),
inference(beta_eta_normalization,[],[f14]) ).
thf(f14,plain,
( ( ^ [Y0: ( $o > $o > $o ) > $o] :
( ( Y0
@ ^ [Y1: $o,Y2: $o] :
( Y2
& Y1 ) )
=> ( Y0
@ ^ [Y1: $o,Y2: $o] :
~ ( ~ Y1
| ~ Y2 ) ) )
@ sK1 )
= $false ),
inference(sigma_clausification,[],[f13]) ).
thf(f13,plain,
( $true
!= ( !! @ ( ( $o > $o > $o ) > $o )
@ ^ [Y0: ( $o > $o > $o ) > $o] :
( ( Y0
@ ^ [Y1: $o,Y2: $o] :
( Y2
& Y1 ) )
=> ( Y0
@ ^ [Y1: $o,Y2: $o] :
~ ( ~ Y1
| ~ Y2 ) ) ) ) ),
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] :
( Y1
& Y0 )
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(definition_unfolding,[],[f10,f11]) ).
thf(f11,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,[],[f8]) ).
thf(f8,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,[],[f7]) ).
thf(f7,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/sandbox/benchmark/theBenchmark.p',leibeq) ).
thf(f10,plain,
( $true
!= ( leibeq
@ ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 )
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( $true
!= ( leibeq
@ ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 )
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
( $true
!= ( leibeq
@ ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 )
@ ^ [Y0: $o,Y1: $o] :
~ ( ~ Y0
| ~ Y1 ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
~ ( leibeq
@ ^ [X0: $o,X1: $o] :
( X0
& X1 )
@ ^ [X2: $o,X3: $o] :
~ ( ~ X3
| ~ X2 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ( leibeq
@ ^ [X3: $o,X4: $o] :
( X3
& X4 )
@ ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
( leibeq
@ ^ [X3: $o,X4: $o] :
( X3
& X4 )
@ ^ [X0: $o,X1: $o] :
~ ( ~ X1
| ~ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(f17,plain,
( $true
= ( sK1
@ ^ [Y0: $o,Y1: $o] :
( Y1
& Y0 ) ) ),
inference(binary_proxy_clausification,[],[f15]) ).
thf(f59,plain,
spl0_1,
inference(avatar_split_clause,[],[f42,f50]) ).
thf(f42,plain,
sK4 = $true,
inference(duplicate_literal_removal,[],[f41]) ).
thf(f41,plain,
( ( sK4 = $true )
| ( sK4 = $true ) ),
inference(not_proxy_clausification,[],[f38]) ).
thf(f38,plain,
( ( ~ sK4 = $false )
| ( sK4 = $true ) ),
inference(binary_proxy_clausification,[],[f37]) ).
thf(f37,plain,
( ( sK4 = $true )
| ( ( ~ sK3
| ~ sK4 )
= $false ) ),
inference(not_proxy_clausification,[],[f36]) ).
thf(f36,plain,
( ( $true
= ( ~ ( ~ sK3
| ~ sK4 ) ) )
| ( sK4 = $true ) ),
inference(binary_proxy_clausification,[],[f26]) ).
thf(f26,plain,
( ( ( sK4
& sK3 )
= $true )
| ( $true
= ( ~ ( ~ sK3
| ~ sK4 ) ) ) ),
inference(binary_proxy_clausification,[],[f25]) ).
thf(f58,plain,
spl0_2,
inference(avatar_split_clause,[],[f47,f54]) ).
thf(f47,plain,
sK3 = $true,
inference(duplicate_literal_removal,[],[f46]) ).
thf(f46,plain,
( ( sK3 = $true )
| ( sK3 = $true ) ),
inference(not_proxy_clausification,[],[f45]) ).
thf(f45,plain,
( ( $false = ~ sK3 )
| ( sK3 = $true ) ),
inference(binary_proxy_clausification,[],[f43]) ).
thf(f43,plain,
( ( sK3 = $true )
| ( ( ~ sK3
| ~ sK4 )
= $false ) ),
inference(not_proxy_clausification,[],[f35]) ).
thf(f35,plain,
( ( $true
= ( ~ ( ~ sK3
| ~ sK4 ) ) )
| ( sK3 = $true ) ),
inference(binary_proxy_clausification,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : SYO022^1 : TPTP v8.2.0. Released v3.7.0.
% 0.11/0.13 % 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.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 10:57:37 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_EQU_NAR problem
% 0.14/0.34 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.36 % (9068)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.36 % (9073)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.36 % (9073)Refutation not found, incomplete strategy
% 0.14/0.36 % (9073)------------------------------
% 0.14/0.36 % (9073)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (9073)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.36
% 0.14/0.36
% 0.14/0.36 % (9073)Memory used [KB]: 5373
% 0.14/0.36 % (9073)Time elapsed: 0.003 s
% 0.14/0.36 % (9073)Instructions burned: 2 (million)
% 0.14/0.36 % (9073)------------------------------
% 0.14/0.36 % (9073)------------------------------
% 0.14/0.37 % (9068)First to succeed.
% 0.14/0.37 % (9068)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.37 % (9068)------------------------------
% 0.14/0.37 % (9068)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (9068)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (9068)Memory used [KB]: 5500
% 0.14/0.37 % (9068)Time elapsed: 0.006 s
% 0.14/0.37 % (9068)Instructions burned: 4 (million)
% 0.14/0.37 % (9068)------------------------------
% 0.14/0.37 % (9068)------------------------------
% 0.14/0.37 % (9067)Success in time 0.012 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------