TSTP Solution File: SEV175^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV175^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n029.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 04:12:15 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 97 ( 50 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 233 ( 36 ~; 6 |; 25 &; 150 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 3 con; 0-2 aty)
% ( 0 !!; 15 ??; 0 @@+; 0 @@-)
% Number of variables : 56 ( 33 ^ 11 !; 10 ?; 56 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_1,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_11,type,
sK0: ( $i > $o ) > $i ).
thf(func_def_13,type,
ph2:
!>[X0: $tType] : X0 ).
thf(func_def_14,type,
sK3: $i > $o ).
thf(func_def_15,type,
sK4: $i > $o ).
thf(func_def_16,type,
sK5: $i > $o ).
thf(f43,plain,
$false,
inference(trivial_inequality_removal,[],[f42]) ).
thf(f42,plain,
$false = $true,
inference(forward_demodulation,[],[f32,f18]) ).
thf(f18,plain,
( $false
= ( sK3 @ ( sK0 @ sK3 ) ) ),
inference(not_proxy_clausification,[],[f15]) ).
thf(f15,plain,
( ( ~ ( sK3 @ ( sK0 @ sK3 ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f14]) ).
thf(f14,plain,
( ( ( ( sK0 @ sK3 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
& ~ ( sK3 @ ( sK0 @ sK3 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f13]) ).
thf(f13,plain,
( ( ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( sK0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( sK0 @ Y2 ) ) ) ) ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) )
@ sK3 )
= $true ),
inference(sigma_clausification,[],[f12]) ).
thf(f12,plain,
( ( ?? @ ( $i > $o )
@ ^ [Y0: $i > $o] :
( ( ( sK0 @ Y0 )
= ( sK0
@ ^ [Y1: $i] :
( ?? @ ( $i > $o )
@ ^ [Y2: $i > $o] :
( ( ( sK0 @ Y2 )
= Y1 )
& ~ ( Y2 @ ( sK0 @ Y2 ) ) ) ) ) )
& ~ ( Y0 @ ( sK0 @ Y0 ) ) ) )
= $true ),
inference(beta_eta_normalization,[],[f11]) ).
thf(f11,plain,
( ( ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) )
@ ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
= $true ),
inference(equality_resolution,[],[f10]) ).
thf(f10,plain,
! [X1: $i > $o] :
( ( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
!= ( sK0 @ X1 ) )
| ( ( X1 @ ( sK0 @ X1 ) )
= $true ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
! [X1: $i > $o] :
( ( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
!= ( sK0 @ X1 ) )
| ( ( X1 @ ( sK0 @ X1 ) )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f7,f8]) ).
thf(f8,plain,
( ? [X0: ( $i > $o ) > $i] :
! [X1: $i > $o] :
( ( ( X0 @ X1 )
!= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) )
=> ! [X1: $i > $o] :
( ( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
!= ( sK0 @ X1 ) )
| ( ( X1 @ ( sK0 @ X1 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
? [X0: ( $i > $o ) > $i] :
! [X1: $i > $o] :
( ( ( X0 @ X1 )
!= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
| ( ( X1 @ ( X0 @ X1 ) )
= $true ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ! [X0: ( $i > $o ) > $i] :
? [X1: $i > $o] :
( ( ( X1 @ ( X0 @ X1 ) )
!= $true )
& ( ( X0 @ X1 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) ) ),
inference(flattening,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( $i > $o ) > $i] :
? [X1: $i > $o] :
( ( ( X0 @ X1 )
= ( X0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( X0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( X0 @ Y1 ) ) ) ) ) )
& ( ( X1 @ ( X0 @ X1 ) )
!= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( $i > $o ) > $i] :
? [X1: $i > $o] :
( ( ( X0
@ ^ [X2: $i] :
? [X3: $i > $o] :
( ~ ( X3 @ ( X0 @ X3 ) )
& ( ( X0 @ X3 )
= X2 ) ) )
= ( X0 @ X1 ) )
& ~ ( X1 @ ( X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X0: ( $i > $o ) > $i] :
? [X1: $i > $o] :
( ( ( X0
@ ^ [X2: $i] :
? [X3: $i > $o] :
( ~ ( X3 @ ( X0 @ X3 ) )
& ( ( X0 @ X3 )
= X2 ) ) )
= ( X0 @ X1 ) )
& ~ ( X1 @ ( X0 @ X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X0: ( $i > $o ) > $i] :
? [X1: $i > $o] :
( ( ( X0
@ ^ [X2: $i] :
? [X3: $i > $o] :
( ~ ( X3 @ ( X0 @ X3 ) )
& ( ( X0 @ X3 )
= X2 ) ) )
= ( X0 @ X1 ) )
& ~ ( X1 @ ( X0 @ X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM144A_pme) ).
thf(f32,plain,
( $true
= ( sK3 @ ( sK0 @ sK3 ) ) ),
inference(equality_resolution,[],[f19]) ).
thf(f19,plain,
! [X0: $i > $o] :
( ( ( sK0 @ sK3 )
!= ( sK0 @ X0 ) )
| ( ( X0 @ ( sK0 @ X0 ) )
= $true ) ),
inference(superposition,[],[f10,f17]) ).
thf(f17,plain,
( ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) )
= ( sK0 @ sK3 ) ),
inference(equality_proxy_clausification,[],[f16]) ).
thf(f16,plain,
( ( ( sK0 @ sK3 )
= ( sK0
@ ^ [Y0: $i] :
( ?? @ ( $i > $o )
@ ^ [Y1: $i > $o] :
( ( ( sK0 @ Y1 )
= Y0 )
& ~ ( Y1 @ ( sK0 @ Y1 ) ) ) ) ) )
= $true ),
inference(binary_proxy_clausification,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEV175^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/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 : n029.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 : Sun May 19 19:08:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.36 % (25837)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.37 % (25837)Instruction limit reached!
% 0.14/0.37 % (25837)------------------------------
% 0.14/0.37 % (25837)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (25837)Termination reason: Unknown
% 0.14/0.37 % (25837)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (25837)Memory used [KB]: 5500
% 0.14/0.37 % (25837)Time elapsed: 0.004 s
% 0.14/0.37 % (25837)Instructions burned: 4 (million)
% 0.14/0.37 % (25837)------------------------------
% 0.14/0.37 % (25837)------------------------------
% 0.14/0.37 % (25836)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 % (25838)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 % (25843)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.37 % (25843)Refutation not found, incomplete strategy
% 0.14/0.37 % (25843)------------------------------
% 0.14/0.37 % (25843)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (25843)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.37
% 0.14/0.37
% 0.14/0.37 % (25843)Memory used [KB]: 5500
% 0.14/0.37 % (25843)Time elapsed: 0.003 s
% 0.14/0.37 % (25843)Instructions burned: 2 (million)
% 0.14/0.37 % (25843)------------------------------
% 0.14/0.37 % (25843)------------------------------
% 0.14/0.37 % (25838)First to succeed.
% 0.14/0.37 % (25836)Also succeeded, but the first one will report.
% 0.14/0.37 % (25841)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 % (25844)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.14/0.38 % (25838)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 % (25838)------------------------------
% 0.14/0.38 % (25838)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (25838)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (25838)Memory used [KB]: 5500
% 0.14/0.38 % (25838)Time elapsed: 0.007 s
% 0.14/0.38 % (25838)Instructions burned: 4 (million)
% 0.14/0.38 % (25838)------------------------------
% 0.14/0.38 % (25838)------------------------------
% 0.14/0.38 % (25835)Success in time 0.018 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------