TSTP Solution File: SYO514^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO514^1 : TPTP v8.2.0. Released v4.1.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 : n003.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:05:36 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 19 ( 5 unt; 4 typ; 0 def)
% Number of atoms : 65 ( 20 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 80 ( 9 ~; 2 |; 4 &; 56 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 85 ( 85 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 4 usr; 3 con; 0-2 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 30 ( 0 ^ 14 !; 14 ?; 30 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_4,type,
sK0: ( ( ( $o > $o ) > $o ) > $o > $o ) > ( $o > $o ) > $o ).
thf(func_def_5,type,
sK1: ( ( ( $o > $o ) > $o ) > $o > $o ) > $o > $o ).
thf(func_def_7,type,
ph3:
!>[X0: $tType] : X0 ).
thf(f22,plain,
$false,
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
$false = $true,
inference(superposition,[],[f11,f16]) ).
thf(f16,plain,
! [X0: $o > $o] :
( $false
= ( sK0 @ @@+ @ ( $o > $o ) @ X0 ) ),
inference(trivial_inequality_removal,[],[f14]) ).
thf(f14,plain,
! [X0: $o > $o] :
( ( $true != $true )
| ( $false
= ( sK0 @ @@+ @ ( $o > $o ) @ X0 ) ) ),
inference(superposition,[],[f10,f12]) ).
thf(f12,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o,X1: $o > $o] :
( ( $true
= ( sK0 @ X0 @ ( @@+ @ ( $o > $o ) @ ( sK0 @ X0 ) ) ) )
| ( ( sK0 @ X0 @ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
( ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true )
& ( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7]) ).
thf(f7,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
( ? [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] :
( ( X1 @ X2 )
= $true )
& ( ( X1 @ ( X0 @ X1 ) )
!= $true ) )
=> ( ? [X2: $o > $o] :
( ( sK0 @ X0 @ X2 )
= $true )
& ( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
( ? [X2: $o > $o] :
( ( sK0 @ X0 @ X2 )
= $true )
=> ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f6,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
? [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] :
( ( X1 @ X2 )
= $true )
& ( ( X1 @ ( X0 @ X1 ) )
!= $true ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ? [X0: ( ( $o > $o ) > $o ) > $o > $o] :
! [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] :
( ( X1 @ X2 )
= $true )
=> ( ( X1 @ ( X0 @ X1 ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ? [X0: ( ( $o > $o ) > $o ) > $o > $o] :
! [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ? [X0: ( ( $o > $o ) > $o ) > $o > $o] :
! [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
? [X0: ( ( $o > $o ) > $o ) > $o > $o] :
! [X1: ( $o > $o ) > $o] :
( ? [X2: $o > $o] : ( X1 @ X2 )
=> ( X1 @ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceoo) ).
thf(f11,plain,
! [X0: ( ( $o > $o ) > $o ) > $o > $o] :
( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO514^1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/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.13/0.35 % Computer : n003.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:27:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 % (8669)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.37 % (8666)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.37 % (8668)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.37 % (8670)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 % (8663)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.38 % (8668)Refutation not found, incomplete strategy
% 0.13/0.38 % (8668)------------------------------
% 0.13/0.38 % (8668)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8666)Refutation not found, incomplete strategy
% 0.13/0.38 % (8666)------------------------------
% 0.13/0.38 % (8666)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8666)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (8666)Memory used [KB]: 5500
% 0.13/0.38 % (8666)Time elapsed: 0.003 s
% 0.13/0.38 % (8666)Instructions burned: 1 (million)
% 0.13/0.38 % (8666)------------------------------
% 0.13/0.38 % (8666)------------------------------
% 0.13/0.38 % (8668)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 % (8668)Memory used [KB]: 5500
% 0.13/0.38 % (8668)Time elapsed: 0.003 s
% 0.13/0.38 % (8664)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.38 % (8668)Instructions burned: 1 (million)
% 0.13/0.38 % (8668)------------------------------
% 0.13/0.38 % (8668)------------------------------
% 0.13/0.38 % (8670)Instruction limit reached!
% 0.13/0.38 % (8670)------------------------------
% 0.13/0.38 % (8670)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8670)Termination reason: Unknown
% 0.13/0.38 % (8670)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (8670)Memory used [KB]: 5500
% 0.13/0.38 % (8670)Time elapsed: 0.004 s
% 0.13/0.38 % (8670)Instructions burned: 3 (million)
% 0.13/0.38 % (8670)------------------------------
% 0.13/0.38 % (8670)------------------------------
% 0.13/0.38 % (8664)Instruction limit reached!
% 0.13/0.38 % (8664)------------------------------
% 0.13/0.38 % (8664)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8664)Termination reason: Unknown
% 0.13/0.38 % (8664)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (8664)Memory used [KB]: 5500
% 0.13/0.38 % (8664)Time elapsed: 0.004 s
% 0.13/0.38 % (8664)Instructions burned: 4 (million)
% 0.13/0.38 % (8664)------------------------------
% 0.13/0.38 % (8664)------------------------------
% 0.13/0.38 % (8665)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.38 % (8665)First to succeed.
% 0.13/0.38 % (8667)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.38 % (8667)Instruction limit reached!
% 0.13/0.38 % (8667)------------------------------
% 0.13/0.38 % (8667)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8667)Termination reason: Unknown
% 0.13/0.38 % (8667)Termination phase: Saturation
% 0.13/0.38
% 0.13/0.38 % (8665)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 % (8665)------------------------------
% 0.13/0.38 % (8665)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (8665)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (8665)Memory used [KB]: 5500
% 0.13/0.38 % (8665)Time elapsed: 0.004 s
% 0.13/0.38 % (8665)Instructions burned: 2 (million)
% 0.13/0.38 % (8665)------------------------------
% 0.13/0.38 % (8665)------------------------------
% 0.13/0.38 % (8662)Success in time 0.021 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------