TSTP Solution File: LCL738^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL738^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 : n002.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 00:22:26 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 31 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 166 ( 58 equ; 0 cnn)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 317 ( 28 ~; 22 |; 17 &; 229 @)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 146 ( 146 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 9 usr; 3 con; 0-3 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 110 ( 0 ^ 53 !; 55 ?; 110 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_2,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_5,type,
sK0: ( ( b > $o ) > b ) > b > $o ).
thf(func_def_6,type,
sK1: ( ( b > $o ) > b ) > b ).
thf(func_def_7,type,
sK2: ( b > $o ) > b > b > $o ).
thf(func_def_8,type,
sK3: ( b > $o ) > b > b > $o ).
thf(func_def_9,type,
sK4: ( b > $o ) > b ).
thf(func_def_10,type,
sK5: b > $o ).
thf(func_def_11,type,
sK6: b > b ).
thf(func_def_13,type,
ph8:
!>[X0: $tType] : X0 ).
thf(f40,plain,
$false,
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
$false = $true,
inference(superposition,[],[f34,f17]) ).
thf(f17,plain,
! [X0: ( b > $o ) > b] :
( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ! [X0: ( b > $o ) > b] :
( ( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) )
& ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) )
& ( ! [X6: b,X7: b > $o] :
( ( $true
= ( sK2 @ X7 @ ( sK4 @ X7 ) @ X6 ) )
| ( $true
= ( sK3 @ X7 @ ( sK4 @ X7 ) @ X6 ) ) )
| ! [X9: b] :
( ( $true
!= ( sK2 @ sK5 @ X9 @ ( sK6 @ X9 ) ) )
& ( ( sK3 @ sK5 @ X9 @ ( sK6 @ X9 ) )
!= $true ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6])],[f7,f13,f12,f11,f10,f9,f8]) ).
thf(f8,plain,
! [X0: ( b > $o ) > b] :
( ? [X1: b > $o] :
( ( $true
!= ( X1 @ ( X0 @ X1 ) ) )
& ? [X2: b] :
( $true
= ( X1 @ X2 ) ) )
=> ( ( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) )
& ? [X2: b] :
( $true
= ( sK0 @ X0 @ X2 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X0: ( b > $o ) > b] :
( ? [X2: b] :
( $true
= ( sK0 @ X0 @ X2 ) )
=> ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
( ? [X3: ( b > $o ) > b > b > $o,X4: ( b > $o ) > b > b > $o] :
( ? [X5: ( b > $o ) > b] :
! [X6: b,X7: b > $o] :
( ( $true
= ( X3 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( ( X4 @ X7 @ ( X5 @ X7 ) @ X6 )
= $true ) )
| ? [X8: b > $o] :
! [X9: b] :
? [X10: b] :
( ( $true
!= ( X3 @ X8 @ X9 @ X10 ) )
& ( $true
!= ( X4 @ X8 @ X9 @ X10 ) ) ) )
=> ( ? [X5: ( b > $o ) > b] :
! [X7: b > $o,X6: b] :
( ( $true
= ( sK2 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( ( sK3 @ X7 @ ( X5 @ X7 ) @ X6 )
= $true ) )
| ? [X8: b > $o] :
! [X9: b] :
? [X10: b] :
( ( $true
!= ( sK2 @ X8 @ X9 @ X10 ) )
& ( $true
!= ( sK3 @ X8 @ X9 @ X10 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X5: ( b > $o ) > b] :
! [X7: b > $o,X6: b] :
( ( $true
= ( sK2 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( ( sK3 @ X7 @ ( X5 @ X7 ) @ X6 )
= $true ) )
=> ! [X7: b > $o,X6: b] :
( ( $true
= ( sK2 @ X7 @ ( sK4 @ X7 ) @ X6 ) )
| ( $true
= ( sK3 @ X7 @ ( sK4 @ X7 ) @ X6 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
( ? [X8: b > $o] :
! [X9: b] :
? [X10: b] :
( ( $true
!= ( sK2 @ X8 @ X9 @ X10 ) )
& ( $true
!= ( sK3 @ X8 @ X9 @ X10 ) ) )
=> ! [X9: b] :
? [X10: b] :
( ( $true
!= ( sK2 @ sK5 @ X9 @ X10 ) )
& ( $true
!= ( sK3 @ sK5 @ X9 @ X10 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
! [X9: b] :
( ? [X10: b] :
( ( $true
!= ( sK2 @ sK5 @ X9 @ X10 ) )
& ( $true
!= ( sK3 @ sK5 @ X9 @ X10 ) ) )
=> ( ( $true
!= ( sK2 @ sK5 @ X9 @ ( sK6 @ X9 ) ) )
& ( ( sK3 @ sK5 @ X9 @ ( sK6 @ X9 ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ! [X0: ( b > $o ) > b] :
? [X1: b > $o] :
( ( $true
!= ( X1 @ ( X0 @ X1 ) ) )
& ? [X2: b] :
( $true
= ( X1 @ X2 ) ) )
& ? [X3: ( b > $o ) > b > b > $o,X4: ( b > $o ) > b > b > $o] :
( ? [X5: ( b > $o ) > b] :
! [X6: b,X7: b > $o] :
( ( $true
= ( X3 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( ( X4 @ X7 @ ( X5 @ X7 ) @ X6 )
= $true ) )
| ? [X8: b > $o] :
! [X9: b] :
? [X10: b] :
( ( $true
!= ( X3 @ X8 @ X9 @ X10 ) )
& ( $true
!= ( X4 @ X8 @ X9 @ X10 ) ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ! [X8: ( b > $o ) > b] :
? [X9: b > $o] :
( ( $true
!= ( X9 @ ( X8 @ X9 ) ) )
& ? [X10: b] :
( $true
= ( X9 @ X10 ) ) )
& ? [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ? [X5: ( b > $o ) > b] :
! [X7: b,X6: b > $o] :
( ( $true
= ( X0 @ X6 @ ( X5 @ X6 ) @ X7 ) )
| ( $true
= ( X1 @ X6 @ ( X5 @ X6 ) @ X7 ) ) )
| ? [X2: b > $o] :
! [X3: b] :
? [X4: b] :
( ( ( X0 @ X2 @ X3 @ X4 )
!= $true )
& ( ( X1 @ X2 @ X3 @ X4 )
!= $true ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ? [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
! [X4: b] :
( ( ( X0 @ X2 @ X3 @ X4 )
= $true )
| ( ( X1 @ X2 @ X3 @ X4 )
= $true ) )
=> ? [X5: ( b > $o ) > b] :
! [X7: b,X6: b > $o] :
( ( $true
= ( X0 @ X6 @ ( X5 @ X6 ) @ X7 ) )
| ( $true
= ( X1 @ X6 @ ( X5 @ X6 ) @ X7 ) ) ) )
=> ? [X8: ( b > $o ) > b] :
! [X9: b > $o] :
( ? [X10: b] :
( $true
= ( X9 @ X10 ) )
=> ( $true
= ( X9 @ ( X8 @ X9 ) ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ? [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
! [X4: b] :
( ( X1 @ X2 @ X3 @ X4 )
| ( X0 @ X2 @ X3 @ X4 ) )
=> ? [X5: ( b > $o ) > b] :
! [X6: b > $o,X7: b] :
( ( X1 @ X6 @ ( X5 @ X6 ) @ X7 )
| ( X0 @ X6 @ ( X5 @ X6 ) @ X7 ) ) )
=> ? [X8: ( b > $o ) > b] :
! [X9: b > $o] :
( ? [X10: b] : ( X9 @ X10 )
=> ( X9 @ ( X8 @ X9 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ? [X1: ( b > $o ) > b > b > $o,X0: ( b > $o ) > b > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
! [X4: b] :
( ( X0 @ X2 @ X3 @ X4 )
| ( X1 @ X2 @ X3 @ X4 ) )
=> ? [X5: ( b > $o ) > b] :
! [X2: b > $o,X4: b] :
( ( X0 @ X2 @ ( X5 @ X2 ) @ X4 )
| ( X1 @ X2 @ ( X5 @ X2 ) @ X4 ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ? [X1: ( b > $o ) > b > b > $o,X0: ( b > $o ) > b > b > $o] :
( ! [X2: b > $o] :
? [X3: b] :
! [X4: b] :
( ( X0 @ X2 @ X3 @ X4 )
| ( X1 @ X2 @ X3 @ X4 ) )
=> ? [X5: ( b > $o ) > b] :
! [X2: b > $o,X4: b] :
( ( X0 @ X2 @ ( X5 @ X2 ) @ X4 )
| ( X1 @ X2 @ ( X5 @ X2 ) @ X4 ) ) )
=> ? [X6: ( b > $o ) > b] :
! [X7: b > $o] :
( ? [X8: b] : ( X7 @ X8 )
=> ( X7 @ ( X6 @ X7 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5310_SUB) ).
thf(f34,plain,
! [X0: b] :
( $false
= ( sK0 @ @@+ @ b @ X0 ) ),
inference(trivial_inequality_removal,[],[f32]) ).
thf(f32,plain,
! [X0: b] :
( ( $false
= ( sK0 @ @@+ @ b @ X0 ) )
| ( $true != $true ) ),
inference(superposition,[],[f18,f30]) ).
thf(f30,plain,
! [X0: ( b > $o ) > b,X1: b] :
( ( $true
= ( sK0 @ X0 @ ( @@+ @ b @ ( sK0 @ X0 ) ) ) )
| ( ( sK0 @ X0 @ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
thf(f18,plain,
! [X0: ( b > $o ) > b] :
( $true
!= ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) ) ),
inference(cnf_transformation,[],[f14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : LCL738^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.15 % 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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 01:23:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/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.15/0.38 % (11480)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (11477)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.15/0.38 % (11478)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.15/0.38 % (11479)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.15/0.38 % (11482)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.15/0.38 % (11484)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.38 % (11483)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.15/0.38 % (11485)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.15/0.38 % (11480)Instruction limit reached!
% 0.15/0.38 % (11480)------------------------------
% 0.15/0.38 % (11480)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (11480)Termination reason: Unknown
% 0.15/0.38 % (11480)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (11480)Memory used [KB]: 5500
% 0.15/0.38 % (11480)Time elapsed: 0.004 s
% 0.15/0.38 % (11480)Instructions burned: 2 (million)
% 0.15/0.38 % (11480)------------------------------
% 0.15/0.38 % (11480)------------------------------
% 0.15/0.39 % (11482)Instruction limit reached!
% 0.15/0.39 % (11482)------------------------------
% 0.15/0.39 % (11482)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11482)Termination reason: Unknown
% 0.15/0.39 % (11482)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (11482)Memory used [KB]: 5500
% 0.15/0.39 % (11482)Time elapsed: 0.004 s
% 0.15/0.39 % (11482)Instructions burned: 2 (million)
% 0.15/0.39 % (11482)------------------------------
% 0.15/0.39 % (11482)------------------------------
% 0.15/0.39 % (11485)Instruction limit reached!
% 0.15/0.39 % (11485)------------------------------
% 0.15/0.39 % (11485)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11483)Refutation not found, incomplete strategy
% 0.15/0.39 % (11483)------------------------------
% 0.15/0.39 % (11483)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11483)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (11483)Memory used [KB]: 5500
% 0.15/0.39 % (11483)Time elapsed: 0.004 s
% 0.15/0.39 % (11483)Instructions burned: 3 (million)
% 0.15/0.39 % (11483)------------------------------
% 0.15/0.39 % (11483)------------------------------
% 0.15/0.39 % (11485)Termination reason: Unknown
% 0.15/0.39 % (11485)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (11485)Memory used [KB]: 5500
% 0.15/0.39 % (11485)Time elapsed: 0.005 s
% 0.15/0.39 % (11485)Instructions burned: 3 (million)
% 0.15/0.39 % (11485)------------------------------
% 0.15/0.39 % (11485)------------------------------
% 0.15/0.39 % (11478)Instruction limit reached!
% 0.15/0.39 % (11478)------------------------------
% 0.15/0.39 % (11478)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11478)Termination reason: Unknown
% 0.15/0.39 % (11478)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (11478)Memory used [KB]: 5500
% 0.15/0.39 % (11478)Time elapsed: 0.006 s
% 0.15/0.39 % (11478)Instructions burned: 5 (million)
% 0.15/0.39 % (11478)------------------------------
% 0.15/0.39 % (11478)------------------------------
% 0.15/0.39 % (11479)First to succeed.
% 0.15/0.39 % (11479)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (11479)------------------------------
% 0.15/0.39 % (11479)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (11479)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (11479)Memory used [KB]: 5500
% 0.15/0.39 % (11479)Time elapsed: 0.007 s
% 0.15/0.39 % (11479)Instructions burned: 4 (million)
% 0.15/0.39 % (11479)------------------------------
% 0.15/0.39 % (11479)------------------------------
% 0.15/0.39 % (11474)Success in time 0.007 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------