TSTP Solution File: LCL730^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL730^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 : n022.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:24 EDT 2024
% Result : Theorem 0.22s 0.40s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of formulae : 26 ( 5 unt; 8 typ; 0 def)
% Number of atoms : 92 ( 34 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 155 ( 15 ~; 5 |; 8 &; 108 @)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 108 ( 108 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 6 usr; 3 con; 0-2 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 74 ( 0 ^ 42 !; 30 ?; 74 :)
% ( 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 > $o ) > ( b > $o ) > b ).
thf(func_def_8,type,
sK3: ( ( b > $o ) > b > $o ) > b > $o ).
thf(func_def_10,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(trivial_inequality_removal,[],[f21]) ).
thf(f21,plain,
$false = $true,
inference(superposition,[],[f20,f15]) ).
thf(f15,plain,
! [X0: ( b > $o ) > b] :
( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X0: ( b > $o ) > b] :
( ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true )
& ( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ) )
& ! [X3: ( b > $o ) > b > $o] :
( ! [X5: b > $o] :
( ( X3 @ X5 @ ( sK2 @ X3 @ X5 ) )
= $true )
| ! [X7: b] :
( ( X3 @ ( sK3 @ X3 ) @ X7 )
!= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f11,f10,f9,f8]) ).
thf(f8,plain,
! [X0: ( b > $o ) > b] :
( ? [X1: b > $o] :
( ? [X2: b] :
( ( X1 @ X2 )
= $true )
& ( ( X1 @ ( X0 @ X1 ) )
!= $true ) )
=> ( ? [X2: b] :
( ( sK0 @ X0 @ X2 )
= $true )
& ( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X0: ( b > $o ) > b] :
( ? [X2: b] :
( ( sK0 @ X0 @ X2 )
= $true )
=> ( ( sK0 @ X0 @ ( sK1 @ X0 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X3: ( b > $o ) > b > $o] :
( ? [X4: ( b > $o ) > b] :
! [X5: b > $o] :
( ( X3 @ X5 @ ( X4 @ X5 ) )
= $true )
=> ! [X5: b > $o] :
( ( X3 @ X5 @ ( sK2 @ X3 @ X5 ) )
= $true ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X3: ( b > $o ) > b > $o] :
( ? [X6: b > $o] :
! [X7: b] :
( $true
!= ( X3 @ X6 @ X7 ) )
=> ! [X7: b] :
( ( X3 @ ( sK3 @ X3 ) @ X7 )
!= $true ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ! [X0: ( b > $o ) > b] :
? [X1: b > $o] :
( ? [X2: b] :
( ( X1 @ X2 )
= $true )
& ( ( X1 @ ( X0 @ X1 ) )
!= $true ) )
& ! [X3: ( b > $o ) > b > $o] :
( ? [X4: ( b > $o ) > b] :
! [X5: b > $o] :
( ( X3 @ X5 @ ( X4 @ X5 ) )
= $true )
| ? [X6: b > $o] :
! [X7: b] :
( $true
!= ( X3 @ X6 @ X7 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ! [X5: ( b > $o ) > b] :
? [X6: b > $o] :
( ? [X7: b] :
( ( X6 @ X7 )
= $true )
& ( ( X6 @ ( X5 @ X6 ) )
!= $true ) )
& ! [X0: ( b > $o ) > b > $o] :
( ? [X3: ( b > $o ) > b] :
! [X4: b > $o] :
( ( X0 @ X4 @ ( X3 @ X4 ) )
= $true )
| ? [X1: b > $o] :
! [X2: b] :
( ( X0 @ X1 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ( ! [X0: ( b > $o ) > b > $o] :
( ! [X1: b > $o] :
? [X2: b] :
( ( X0 @ X1 @ X2 )
= $true )
=> ? [X3: ( b > $o ) > b] :
! [X4: b > $o] :
( ( X0 @ X4 @ ( X3 @ X4 ) )
= $true ) )
=> ? [X5: ( b > $o ) > b] :
! [X6: b > $o] :
( ? [X7: b] :
( ( X6 @ X7 )
= $true )
=> ( ( X6 @ ( X5 @ X6 ) )
= $true ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ! [X0: ( b > $o ) > b > $o] :
( ! [X1: b > $o] :
? [X2: b] : ( X0 @ X1 @ X2 )
=> ? [X3: ( b > $o ) > b] :
! [X4: b > $o] : ( X0 @ X4 @ ( X3 @ X4 ) ) )
=> ? [X5: ( b > $o ) > b] :
! [X6: b > $o] :
( ? [X7: b] : ( X6 @ X7 )
=> ( X6 @ ( X5 @ X6 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [X0: ( b > $o ) > b > $o] :
( ! [X1: b > $o] :
? [X2: b] : ( X0 @ X1 @ X2 )
=> ? [X3: ( b > $o ) > b] :
! [X1: b > $o] : ( X0 @ X1 @ ( X3 @ X1 ) ) )
=> ? [X4: ( b > $o ) > b] :
! [X5: b > $o] :
( ? [X6: b] : ( X5 @ X6 )
=> ( X5 @ ( X4 @ X5 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ! [X0: ( b > $o ) > b > $o] :
( ! [X1: b > $o] :
? [X2: b] : ( X0 @ X1 @ X2 )
=> ? [X3: ( b > $o ) > b] :
! [X1: b > $o] : ( X0 @ X1 @ ( X3 @ X1 ) ) )
=> ? [X4: ( b > $o ) > b] :
! [X5: b > $o] :
( ? [X6: b] : ( X5 @ X6 )
=> ( X5 @ ( X4 @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX5310) ).
thf(f20,plain,
! [X0: b] :
( ( sK0 @ @@+ @ b @ X0 )
= $false ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
! [X0: b] :
( ( ( sK0 @ @@+ @ b @ X0 )
= $false )
| ( $true != $true ) ),
inference(superposition,[],[f14,f16]) ).
thf(f16,plain,
! [X0: ( b > $o ) > b,X1: b] :
( ( ( sK0 @ X0 @ ( @@+ @ b @ ( sK0 @ X0 ) ) )
= $true )
| ( ( sK0 @ X0 @ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
thf(f14,plain,
! [X0: ( b > $o ) > b] :
( ( sK0 @ X0 @ ( X0 @ ( sK0 @ X0 ) ) )
!= $true ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL730^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.15/0.36 % Computer : n022.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 02:17:07 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.37 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.15/0.39 % (26293)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.39 % (26292)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.39 % (26297)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.39 % (26295)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.39 % (26299)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.39 % (26295)Instruction limit reached!
% 0.15/0.39 % (26295)------------------------------
% 0.15/0.39 % (26295)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26295)Termination reason: Unknown
% 0.15/0.39 % (26295)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26295)Memory used [KB]: 5500
% 0.15/0.39 % (26295)Time elapsed: 0.004 s
% 0.15/0.39 % (26295)Instructions burned: 2 (million)
% 0.15/0.39 % (26295)------------------------------
% 0.15/0.39 % (26295)------------------------------
% 0.15/0.39 % (26296)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.39 % (26293)Instruction limit reached!
% 0.15/0.39 % (26293)------------------------------
% 0.15/0.39 % (26293)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26293)Termination reason: Unknown
% 0.15/0.39 % (26293)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26293)Memory used [KB]: 5500
% 0.15/0.39 % (26293)Time elapsed: 0.006 s
% 0.15/0.39 % (26293)Instructions burned: 4 (million)
% 0.15/0.39 % (26293)------------------------------
% 0.15/0.39 % (26293)------------------------------
% 0.15/0.39 % (26296)Instruction limit reached!
% 0.15/0.39 % (26296)------------------------------
% 0.15/0.39 % (26296)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26296)Termination reason: Unknown
% 0.15/0.39 % (26296)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26299)Instruction limit reached!
% 0.15/0.39 % (26299)------------------------------
% 0.15/0.39 % (26299)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26299)Termination reason: Unknown
% 0.15/0.39 % (26299)Termination phase: Saturation
% 0.15/0.39
% 0.15/0.39 % (26299)Memory used [KB]: 5500
% 0.15/0.39 % (26299)Time elapsed: 0.004 s
% 0.15/0.39 % (26299)Instructions burned: 4 (million)
% 0.15/0.39 % (26299)------------------------------
% 0.15/0.39 % (26299)------------------------------
% 0.15/0.39 % (26296)Memory used [KB]: 5373
% 0.15/0.39 % (26296)Time elapsed: 0.003 s
% 0.15/0.39 % (26296)Instructions burned: 2 (million)
% 0.15/0.39 % (26296)------------------------------
% 0.15/0.39 % (26296)------------------------------
% 0.15/0.39 % (26297)Refutation not found, incomplete strategy
% 0.15/0.39 % (26297)------------------------------
% 0.15/0.39 % (26297)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (26297)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (26297)Memory used [KB]: 5500
% 0.15/0.39 % (26297)Time elapsed: 0.006 s
% 0.15/0.39 % (26297)Instructions burned: 5 (million)
% 0.15/0.39 % (26297)------------------------------
% 0.15/0.39 % (26297)------------------------------
% 0.15/0.39 % (26298)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.40 % (26294)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.22/0.40 % (26294)First to succeed.
% 0.22/0.40 % (26294)Refutation found. Thanks to Tanya!
% 0.22/0.40 % SZS status Theorem for theBenchmark
% 0.22/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40 % (26294)------------------------------
% 0.22/0.40 % (26294)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (26294)Termination reason: Refutation
% 0.22/0.40
% 0.22/0.40 % (26294)Memory used [KB]: 5500
% 0.22/0.40 % (26294)Time elapsed: 0.005 s
% 0.22/0.40 % (26294)Instructions burned: 3 (million)
% 0.22/0.40 % (26294)------------------------------
% 0.22/0.40 % (26294)------------------------------
% 0.22/0.40 % (26291)Success in time 0.018 s
% 0.22/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------