TSTP Solution File: SYO268^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO268^5 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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:03:43 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 51 ( 1 unt; 12 typ; 0 def)
% Number of atoms : 211 ( 60 equ; 0 cnn)
% Maximal formula atoms : 6 ( 5 avg)
% Number of connectives : 297 ( 60 ~; 43 |; 9 &; 163 @)
% ( 8 <=>; 13 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 56 ( 56 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 103 ( 0 ^ 62 !; 39 ?; 103 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(type_def_6,type,
b: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_1,type,
b: $tType ).
thf(func_def_2,type,
r: a > b > $o ).
thf(func_def_4,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_7,type,
sK0: ( b > $o ) > b ).
thf(func_def_8,type,
sK1: ( a > b ) > a ).
thf(func_def_9,type,
sK2: a ).
thf(func_def_10,type,
sK3: a > b ).
thf(func_def_11,type,
sK4: a > b ).
thf(func_def_13,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f45,plain,
$false,
inference(avatar_sat_refutation,[],[f25,f32,f35,f38,f41,f44]) ).
thf(f44,plain,
( ~ spl5_1
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f43]) ).
thf(f43,plain,
( $false
| ~ spl5_1
| ~ spl5_4 ),
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
( ( $true != $true )
| ~ spl5_1
| ~ spl5_4 ),
inference(superposition,[],[f31,f21]) ).
thf(f21,plain,
( ! [X8: a] :
( ( r @ X8 @ ( sK3 @ X8 ) )
= $true )
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f20]) ).
thf(f20,plain,
( spl5_1
<=> ! [X8: a] :
( ( r @ X8 @ ( sK3 @ X8 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
thf(f31,plain,
( ! [X6: b] :
( ( r @ sK2 @ X6 )
!= $true )
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f30]) ).
thf(f30,plain,
( spl5_4
<=> ! [X6: b] :
( ( r @ sK2 @ X6 )
!= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
thf(f41,plain,
( ~ spl5_2
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f40]) ).
thf(f40,plain,
( $false
| ~ spl5_2
| ~ spl5_4 ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( $true != $true )
| ~ spl5_2
| ~ spl5_4 ),
inference(superposition,[],[f31,f24]) ).
thf(f24,plain,
( ! [X9: a] :
( ( r @ X9 @ ( sK4 @ X9 ) )
= $true )
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f23]) ).
thf(f23,plain,
( spl5_2
<=> ! [X9: a] :
( ( r @ X9 @ ( sK4 @ X9 ) )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
thf(f38,plain,
( ~ spl5_1
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f37]) ).
thf(f37,plain,
( $false
| ~ spl5_1
| ~ spl5_3 ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( $true != $true )
| ~ spl5_1
| ~ spl5_3 ),
inference(superposition,[],[f28,f21]) ).
thf(f28,plain,
( ! [X3: a > b] :
( $true
!= ( r @ ( sK1 @ X3 ) @ ( X3 @ ( sK1 @ X3 ) ) ) )
| ~ spl5_3 ),
inference(avatar_component_clause,[],[f27]) ).
thf(f27,plain,
( spl5_3
<=> ! [X3: a > b] :
( $true
!= ( r @ ( sK1 @ X3 ) @ ( X3 @ ( sK1 @ X3 ) ) ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
thf(f35,plain,
( ~ spl5_2
| ~ spl5_3 ),
inference(avatar_contradiction_clause,[],[f34]) ).
thf(f34,plain,
( $false
| ~ spl5_2
| ~ spl5_3 ),
inference(trivial_inequality_removal,[],[f33]) ).
thf(f33,plain,
( ( $true != $true )
| ~ spl5_2
| ~ spl5_3 ),
inference(superposition,[],[f28,f24]) ).
thf(f32,plain,
( spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f17,f30,f27]) ).
thf(f17,plain,
! [X3: a > b,X6: b] :
( ( ( r @ sK2 @ X6 )
!= $true )
| ( $true
!= ( r @ ( sK1 @ X3 ) @ ( X3 @ ( sK1 @ X3 ) ) ) ) ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( $true
= ( X1 @ ( sK0 @ X1 ) ) ) )
& ( ! [X3: a > b] :
( $true
!= ( r @ ( sK1 @ X3 ) @ ( X3 @ ( sK1 @ X3 ) ) ) )
| ! [X6: b] :
( ( r @ sK2 @ X6 )
!= $true ) )
& ( ! [X8: a] :
( ( r @ X8 @ ( sK3 @ X8 ) )
= $true )
| ! [X9: a] :
( ( r @ X9 @ ( sK4 @ X9 ) )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f9,f14,f13,f12,f11,f10]) ).
thf(f10,plain,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
=> ! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( $true
= ( X1 @ ( sK0 @ X1 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X3: a > b] :
( ? [X4: a] :
( ( r @ X4 @ ( X3 @ X4 ) )
!= $true )
=> ( $true
!= ( r @ ( sK1 @ X3 ) @ ( X3 @ ( sK1 @ X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X5: a] :
! [X6: b] :
( ( r @ X5 @ X6 )
!= $true )
=> ! [X6: b] :
( ( r @ sK2 @ X6 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
( ? [X7: a > b] :
! [X8: a] :
( ( r @ X8 @ ( X7 @ X8 ) )
= $true )
=> ! [X8: a] :
( ( r @ X8 @ ( sK3 @ X8 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
! [X9: a] :
( ? [X10: b] :
( $true
= ( r @ X9 @ X10 ) )
=> ( ( r @ X9 @ ( sK4 @ X9 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
& ( ! [X3: a > b] :
? [X4: a] :
( ( r @ X4 @ ( X3 @ X4 ) )
!= $true )
| ? [X5: a] :
! [X6: b] :
( ( r @ X5 @ X6 )
!= $true ) )
& ( ? [X7: a > b] :
! [X8: a] :
( ( r @ X8 @ ( X7 @ X8 ) )
= $true )
| ! [X9: a] :
? [X10: b] :
( $true
= ( r @ X9 @ X10 ) ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
& ( ! [X5: a > b] :
? [X6: a] :
( $true
!= ( r @ X6 @ ( X5 @ X6 ) ) )
| ? [X3: a] :
! [X4: b] :
( ( r @ X3 @ X4 )
!= $true ) )
& ( ? [X5: a > b] :
! [X6: a] :
( $true
= ( r @ X6 @ ( X5 @ X6 ) ) )
| ! [X3: a] :
? [X4: b] :
( ( r @ X3 @ X4 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
& ( ! [X5: a > b] :
? [X6: a] :
( $true
!= ( r @ X6 @ ( X5 @ X6 ) ) )
| ? [X3: a] :
! [X4: b] :
( ( r @ X3 @ X4 )
!= $true ) )
& ( ? [X5: a > b] :
! [X6: a] :
( $true
= ( r @ X6 @ ( X5 @ X6 ) ) )
| ! [X3: a] :
? [X4: b] :
( ( r @ X3 @ X4 )
= $true ) ) ),
inference(nnf_transformation,[],[f6]) ).
thf(f6,plain,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ! [X2: b] :
( ( X1 @ X2 )
!= $true )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
& ( ! [X3: a] :
? [X4: b] :
( ( r @ X3 @ X4 )
= $true )
<~> ? [X5: a > b] :
! [X6: a] :
( $true
= ( r @ X6 @ ( X5 @ X6 ) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ? [X2: b] :
( ( X1 @ X2 )
= $true )
=> ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
=> ( ? [X5: a > b] :
! [X6: a] :
( $true
= ( r @ X6 @ ( X5 @ X6 ) ) )
<=> ! [X3: a] :
? [X4: b] :
( ( r @ X3 @ X4 )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) )
=> ( ! [X3: a] :
? [X4: b] : ( r @ X3 @ X4 )
<=> ? [X5: a > b] :
! [X6: a] : ( r @ X6 @ ( X5 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) )
=> ( ! [X2: a] :
? [X3: b] : ( r @ X2 @ X3 )
<=> ? [X4: a > b] :
! [X2: a] : ( r @ X2 @ ( X4 @ X2 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ? [X0: ( b > $o ) > b] :
! [X1: b > $o] :
( ? [X2: b] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) )
=> ( ! [X2: a] :
? [X3: b] : ( r @ X2 @ X3 )
<=> ? [X4: a > b] :
! [X2: a] : ( r @ X2 @ ( X4 @ X2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5308) ).
thf(f25,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f16,f23,f20]) ).
thf(f16,plain,
! [X8: a,X9: a] :
( ( ( r @ X8 @ ( sK3 @ X8 ) )
= $true )
| ( ( r @ X9 @ ( sK4 @ X9 ) )
= $true ) ),
inference(cnf_transformation,[],[f15]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO268^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/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.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:14:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/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.13/0.37 % (14105)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.13/0.37 % (14109)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.13/0.37 % (14107)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.13/0.37 % (14108)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (14106)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.13/0.37 % (14108)Instruction limit reached!
% 0.13/0.37 % (14108)------------------------------
% 0.13/0.37 % (14108)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14108)Termination reason: Unknown
% 0.13/0.37 % (14108)Termination phase: Saturation
% 0.13/0.37 % (14109)Instruction limit reached!
% 0.13/0.37 % (14109)------------------------------
% 0.13/0.37 % (14109)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (14109)Termination reason: Unknown
% 0.13/0.37 % (14109)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (14109)Memory used [KB]: 5373
% 0.13/0.37 % (14109)Time elapsed: 0.003 s
% 0.13/0.37 % (14109)Instructions burned: 2 (million)
% 0.13/0.37 % (14109)------------------------------
% 0.13/0.37 % (14109)------------------------------
% 0.13/0.37
% 0.13/0.37 % (14108)Memory used [KB]: 5373
% 0.13/0.37 % (14108)Time elapsed: 0.003 s
% 0.13/0.37 % (14108)Instructions burned: 2 (million)
% 0.13/0.37 % (14108)------------------------------
% 0.13/0.37 % (14108)------------------------------
% 0.13/0.37 % (14112)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.13/0.37 % (14110)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.13/0.38 % (14107)First to succeed.
% 0.13/0.38 % (14106)Instruction limit reached!
% 0.13/0.38 % (14106)------------------------------
% 0.13/0.38 % (14106)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14106)Termination reason: Unknown
% 0.13/0.38 % (14106)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (14106)Memory used [KB]: 5500
% 0.13/0.38 % (14106)Time elapsed: 0.004 s
% 0.13/0.38 % (14106)Instructions burned: 4 (million)
% 0.13/0.38 % (14106)------------------------------
% 0.13/0.38 % (14106)------------------------------
% 0.13/0.38 % (14112)Instruction limit reached!
% 0.13/0.38 % (14112)------------------------------
% 0.13/0.38 % (14112)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14112)Termination reason: Unknown
% 0.13/0.38 % (14112)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (14112)Memory used [KB]: 5500
% 0.13/0.38 % (14112)Time elapsed: 0.004 s
% 0.13/0.38 % (14112)Instructions burned: 3 (million)
% 0.13/0.38 % (14112)------------------------------
% 0.13/0.38 % (14112)------------------------------
% 0.13/0.38 % (14111)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.38 % (14107)Refutation found. Thanks to Tanya!
% 0.13/0.38 % SZS status Theorem for theBenchmark
% 0.13/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.38 % (14107)------------------------------
% 0.13/0.38 % (14107)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (14107)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (14107)Memory used [KB]: 5500
% 0.13/0.38 % (14107)Time elapsed: 0.004 s
% 0.13/0.38 % (14107)Instructions burned: 2 (million)
% 0.13/0.38 % (14107)------------------------------
% 0.13/0.38 % (14107)------------------------------
% 0.13/0.38 % (14104)Success in time 0.008 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------