TSTP Solution File: SYO006^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO006^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 : n004.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:11 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 15 unt; 2 typ; 0 def)
% Number of atoms : 177 ( 44 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 136 ( 30 ~; 29 |; 4 &; 49 @)
% ( 7 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 8 usr; 9 con; 0-2 aty)
% ( 4 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 35 ( 17 ^ 13 !; 4 ?; 35 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
leibeq: $o > $o > $o ).
thf(func_def_14,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f107,plain,
$false,
inference(avatar_sat_refutation,[],[f30,f39,f65,f81,f91,f103]) ).
thf(f103,plain,
( spl2_3
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f102]) ).
thf(f102,plain,
( $false
| spl2_3
| ~ spl2_4 ),
inference(subsumption_resolution,[],[f85,f33]) ).
thf(f33,plain,
( ( $false != sK0 )
| spl2_3 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f32,plain,
( spl2_3
<=> ( $false = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).
thf(f85,plain,
( ( $false = sK0 )
| ~ spl2_4 ),
inference(beta_eta_normalization,[],[f84]) ).
thf(f84,plain,
( ( ( ^ [Y0: $o] : Y0
@ sK0 )
= $false )
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
( ( $false = $true )
| ( ( ^ [Y0: $o] : Y0
@ sK0 )
= $false )
| ~ spl2_4 ),
inference(superposition,[],[f38,f21]) ).
thf(f21,plain,
! [X1: $o > $o] :
( ( $true
= ( X1 @ sK1 ) )
| ( $false
= ( X1 @ sK0 ) ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
! [X1: $o > $o] :
( $true
= ( ( X1 @ sK0 )
=> ( X1 @ sK1 ) ) ),
inference(beta_eta_normalization,[],[f19]) ).
thf(f19,plain,
! [X1: $o > $o] :
( $true
= ( ^ [Y0: $o > $o] :
( ( Y0 @ sK0 )
=> ( Y0 @ sK1 ) )
@ X1 ) ),
inference(pi_clausification,[],[f18]) ).
thf(f18,plain,
( $true
= ( !! @ ( $o > $o )
@ ^ [Y0: $o > $o] :
( ( Y0 @ sK0 )
=> ( Y0 @ sK1 ) ) ) ),
inference(beta_eta_normalization,[],[f15]) ).
thf(f15,plain,
( $true
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) )
@ sK0
@ sK1 ) ),
inference(definition_unfolding,[],[f14,f12]) ).
thf(f12,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
( leibeq
= ( ^ [Y0: $o,Y1: $o] :
( !! @ ( $o > $o )
@ ^ [Y2: $o > $o] :
( ( Y2 @ Y0 )
=> ( Y2 @ Y1 ) ) ) ) ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: $o,X1: $o] :
! [X2: $o > $o] :
( ( X2 @ X0 )
=> ( X2 @ X1 ) ) )
= leibeq ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',leibeq1) ).
thf(f14,plain,
( $true
= ( leibeq @ sK0 @ sK1 ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( $true
= ( leibeq @ sK0 @ sK1 ) )
& ( sK0 != sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: $o,X1: $o] :
( ( $true
= ( leibeq @ X0 @ X1 ) )
& ( X0 != X1 ) )
=> ( ( $true
= ( leibeq @ sK0 @ sK1 ) )
& ( sK0 != sK1 ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
? [X0: $o,X1: $o] :
( ( $true
= ( leibeq @ X0 @ X1 ) )
& ( X0 != X1 ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
~ ! [X0: $o,X1: $o] :
( ( $true
= ( leibeq @ X0 @ X1 ) )
=> ( X0 = X1 ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ! [X0: $o,X1: $o] :
( ( leibeq @ X0 @ X1 )
=> ( X0
<=> X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ! [X3: $o,X4: $o] :
( ( leibeq @ X3 @ X4 )
=> ( X3
<=> X4 ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
! [X3: $o,X4: $o] :
( ( leibeq @ X3 @ X4 )
=> ( X3
<=> X4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(f38,plain,
( ( $false = sK1 )
| ~ spl2_4 ),
inference(avatar_component_clause,[],[f36]) ).
thf(f36,plain,
( spl2_4
<=> ( $false = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).
thf(f91,plain,
( ~ spl2_1
| ~ spl2_3 ),
inference(avatar_contradiction_clause,[],[f90]) ).
thf(f90,plain,
( $false
| ~ spl2_1
| ~ spl2_3 ),
inference(trivial_inequality_removal,[],[f86]) ).
thf(f86,plain,
( ( $false = $true )
| ~ spl2_1
| ~ spl2_3 ),
inference(superposition,[],[f25,f34]) ).
thf(f34,plain,
( ( $false = sK0 )
| ~ spl2_3 ),
inference(avatar_component_clause,[],[f32]) ).
thf(f25,plain,
( ( $true = sK0 )
| ~ spl2_1 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl2_1
<=> ( $true = sK0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).
thf(f81,plain,
( ~ spl2_2
| ~ spl2_4 ),
inference(avatar_contradiction_clause,[],[f80]) ).
thf(f80,plain,
( $false
| ~ spl2_2
| ~ spl2_4 ),
inference(trivial_inequality_removal,[],[f73]) ).
thf(f73,plain,
( ( $false = $true )
| ~ spl2_2
| ~ spl2_4 ),
inference(superposition,[],[f38,f29]) ).
thf(f29,plain,
( ( $true = sK1 )
| ~ spl2_2 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl2_2
<=> ( $true = sK1 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).
thf(f65,plain,
( spl2_4
| spl2_1 ),
inference(avatar_split_clause,[],[f51,f23,f36]) ).
thf(f51,plain,
( ( $false = sK1 )
| ( $true = sK0 ) ),
inference(binary_proxy_clausification,[],[f41]) ).
thf(f41,plain,
sK0 = sK1,
inference(leibniz_equality_elimination,[],[f21]) ).
thf(f39,plain,
( spl2_3
| spl2_4 ),
inference(avatar_split_clause,[],[f17,f36,f32]) ).
thf(f17,plain,
( ( $false = sK0 )
| ( $false = sK1 ) ),
inference(binary_proxy_clausification,[],[f13]) ).
thf(f13,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f11]) ).
thf(f30,plain,
( spl2_1
| spl2_2 ),
inference(avatar_split_clause,[],[f16,f27,f23]) ).
thf(f16,plain,
( ( $true = sK0 )
| ( $true = sK1 ) ),
inference(binary_proxy_clausification,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO006^1 : TPTP v8.2.0. Released v3.7.0.
% 0.13/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 : n004.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 11:01: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.37 % (25641)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 % (25645)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 % (25643)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 % (25647)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 % (25646)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 % (25642)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 % (25648)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 % (25645)Instruction limit reached!
% 0.14/0.38 % (25645)------------------------------
% 0.14/0.38 % (25645)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25645)Termination reason: Unknown
% 0.14/0.38 % (25645)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (25645)Memory used [KB]: 5373
% 0.14/0.38 % (25645)Time elapsed: 0.003 s
% 0.14/0.38 % (25645)Instructions burned: 2 (million)
% 0.14/0.38 % (25645)------------------------------
% 0.14/0.38 % (25645)------------------------------
% 0.14/0.38 % (25644)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.38 % (25643)Refutation not found, incomplete strategy
% 0.14/0.38 % (25643)------------------------------
% 0.14/0.38 % (25643)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25643)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (25643)Memory used [KB]: 5500
% 0.14/0.38 % (25643)Time elapsed: 0.004 s
% 0.14/0.38 % (25643)Instructions burned: 2 (million)
% 0.14/0.38 % (25646)Refutation not found, incomplete strategy
% 0.14/0.38 % (25646)------------------------------
% 0.14/0.38 % (25646)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25643)------------------------------
% 0.14/0.38 % (25643)------------------------------
% 0.14/0.38 % (25646)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (25646)Memory used [KB]: 5500
% 0.14/0.38 % (25646)Time elapsed: 0.004 s
% 0.14/0.38 % (25646)Instructions burned: 2 (million)
% 0.14/0.38 % (25646)------------------------------
% 0.14/0.38 % (25646)------------------------------
% 0.14/0.38 % (25644)Instruction limit reached!
% 0.14/0.38 % (25644)------------------------------
% 0.14/0.38 % (25644)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25644)Termination reason: Unknown
% 0.14/0.38 % (25644)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (25644)Memory used [KB]: 5500
% 0.14/0.38 % (25644)Time elapsed: 0.003 s
% 0.14/0.38 % (25644)Instructions burned: 2 (million)
% 0.14/0.38 % (25644)------------------------------
% 0.14/0.38 % (25644)------------------------------
% 0.14/0.38 % (25648)Refutation not found, incomplete strategy
% 0.14/0.38 % (25648)------------------------------
% 0.14/0.38 % (25648)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25648)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.38
% 0.14/0.38
% 0.14/0.38 % (25648)Memory used [KB]: 5500
% 0.14/0.38 % (25648)Time elapsed: 0.003 s
% 0.14/0.38 % (25648)Instructions burned: 2 (million)
% 0.14/0.38 % (25648)------------------------------
% 0.14/0.38 % (25648)------------------------------
% 0.14/0.38 % (25641)First to succeed.
% 0.14/0.38 % (25642)Instruction limit reached!
% 0.14/0.38 % (25642)------------------------------
% 0.14/0.38 % (25642)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25642)Termination reason: Unknown
% 0.14/0.38 % (25642)Termination phase: Saturation
% 0.14/0.38
% 0.14/0.38 % (25647)Also succeeded, but the first one will report.
% 0.14/0.38 % (25642)Memory used [KB]: 5500
% 0.14/0.38 % (25642)Time elapsed: 0.006 s
% 0.14/0.38 % (25642)Instructions burned: 4 (million)
% 0.14/0.38 % (25642)------------------------------
% 0.14/0.38 % (25642)------------------------------
% 0.14/0.38 % (25641)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 % (25641)------------------------------
% 0.14/0.38 % (25641)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25641)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (25641)Memory used [KB]: 5500
% 0.14/0.38 % (25641)Time elapsed: 0.007 s
% 0.14/0.38 % (25641)Instructions burned: 4 (million)
% 0.14/0.38 % (25641)------------------------------
% 0.14/0.38 % (25641)------------------------------
% 0.14/0.38 % (25638)Success in time 0.004 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------