TSTP Solution File: LCL739^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL739^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 : n027.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.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 28 ( 5 unt; 9 typ; 0 def)
% Number of atoms : 130 ( 50 equ; 0 cnn)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 310 ( 24 ~; 18 |; 15 &; 233 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 184 ( 184 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 7 usr; 3 con; 0-3 aty)
% ( 0 !!; 0 ??; 3 @@+; 0 @@-)
% Number of variables : 104 ( 0 ^ 67 !; 35 ?; 104 :)
% ( 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 ) > ( ( b > $o ) > b > b > $o ) > ( b > $o ) > b ).
thf(func_def_6,type,
sK1: ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > b > $o ).
thf(func_def_7,type,
sK2: b > ( ( b > $o ) > b > b > $o ) > ( ( b > $o ) > b > b > $o ) > b ).
thf(func_def_8,type,
sK3: ( ( b > $o ) > b ) > b > $o ).
thf(func_def_9,type,
sK4: ( ( b > $o ) > b ) > b ).
thf(func_def_11,type,
ph6:
!>[X0: $tType] : X0 ).
thf(f28,plain,
$false,
inference(trivial_inequality_removal,[],[f23]) ).
thf(f23,plain,
$true = $false,
inference(superposition,[],[f22,f14]) ).
thf(f14,plain,
! [X8: ( b > $o ) > b] :
( $true
= ( sK3 @ X8 @ ( sK4 @ X8 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ! [X3: b > $o,X4: b] :
( ( $true
= ( X1 @ X3 @ ( sK0 @ X1 @ X0 @ X3 ) @ X4 ) )
| ( $true
= ( X0 @ X3 @ ( sK0 @ X1 @ X0 @ X3 ) @ X4 ) ) )
| ! [X6: b] :
( ( ( X0 @ ( sK1 @ X1 @ X0 ) @ X6 @ ( sK2 @ X6 @ X1 @ X0 ) )
!= $true )
& ( $true
!= ( X1 @ ( sK1 @ X1 @ X0 ) @ X6 @ ( sK2 @ X6 @ X1 @ X0 ) ) ) ) )
& ! [X8: ( b > $o ) > b] :
( ( $true
!= ( sK3 @ X8 @ ( X8 @ ( sK3 @ X8 ) ) ) )
& ( $true
= ( sK3 @ X8 @ ( sK4 @ X8 ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f7,f12,f11,f10,f9,f8]) ).
thf(f8,plain,
! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ? [X2: ( b > $o ) > b] :
! [X3: b > $o,X4: b] :
( ( ( X1 @ X3 @ ( X2 @ X3 ) @ X4 )
= $true )
| ( $true
= ( X0 @ X3 @ ( X2 @ X3 ) @ X4 ) ) )
=> ! [X4: b,X3: b > $o] :
( ( $true
= ( X1 @ X3 @ ( sK0 @ X1 @ X0 @ X3 ) @ X4 ) )
| ( $true
= ( X0 @ X3 @ ( sK0 @ X1 @ X0 @ X3 ) @ X4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ? [X5: b > $o] :
! [X6: b] :
? [X7: b] :
( ( $true
!= ( X0 @ X5 @ X6 @ X7 ) )
& ( $true
!= ( X1 @ X5 @ X6 @ X7 ) ) )
=> ! [X6: b] :
? [X7: b] :
( ( $true
!= ( X0 @ ( sK1 @ X1 @ X0 ) @ X6 @ X7 ) )
& ( ( X1 @ ( sK1 @ X1 @ X0 ) @ X6 @ X7 )
!= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o,X6: b] :
( ? [X7: b] :
( ( $true
!= ( X0 @ ( sK1 @ X1 @ X0 ) @ X6 @ X7 ) )
& ( ( X1 @ ( sK1 @ X1 @ X0 ) @ X6 @ X7 )
!= $true ) )
=> ( ( ( X0 @ ( sK1 @ X1 @ X0 ) @ X6 @ ( sK2 @ X6 @ X1 @ X0 ) )
!= $true )
& ( $true
!= ( X1 @ ( sK1 @ X1 @ X0 ) @ X6 @ ( sK2 @ X6 @ X1 @ X0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
! [X8: ( b > $o ) > b] :
( ? [X9: b > $o] :
( ( $true
!= ( X9 @ ( X8 @ X9 ) ) )
& ? [X10: b] :
( $true
= ( X9 @ X10 ) ) )
=> ( ( $true
!= ( sK3 @ X8 @ ( X8 @ ( sK3 @ X8 ) ) ) )
& ? [X10: b] :
( $true
= ( sK3 @ X8 @ X10 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f12,plain,
! [X8: ( b > $o ) > b] :
( ? [X10: b] :
( $true
= ( sK3 @ X8 @ X10 ) )
=> ( $true
= ( sK3 @ X8 @ ( sK4 @ X8 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f7,plain,
( ! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ? [X2: ( b > $o ) > b] :
! [X3: b > $o,X4: b] :
( ( ( X1 @ X3 @ ( X2 @ X3 ) @ X4 )
= $true )
| ( $true
= ( X0 @ X3 @ ( X2 @ X3 ) @ X4 ) ) )
| ? [X5: b > $o] :
! [X6: b] :
? [X7: b] :
( ( $true
!= ( X0 @ X5 @ X6 @ X7 ) )
& ( $true
!= ( X1 @ X5 @ X6 @ X7 ) ) ) )
& ! [X8: ( b > $o ) > b] :
? [X9: b > $o] :
( ( $true
!= ( X9 @ ( X8 @ X9 ) ) )
& ? [X10: b] :
( $true
= ( X9 @ X10 ) ) ) ),
inference(rectify,[],[f6]) ).
thf(f6,plain,
( ! [X0: ( b > $o ) > b > b > $o,X1: ( b > $o ) > b > b > $o] :
( ? [X5: ( b > $o ) > b] :
! [X7: b > $o,X6: b] :
( ( $true
= ( X1 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( $true
= ( X0 @ X7 @ ( X5 @ X7 ) @ X6 ) ) )
| ? [X2: b > $o] :
! [X3: b] :
? [X4: b] :
( ( ( X0 @ X2 @ X3 @ X4 )
!= $true )
& ( ( X1 @ X2 @ X3 @ X4 )
!= $true ) ) )
& ! [X8: ( b > $o ) > b] :
? [X9: b > $o] :
( ( $true
!= ( X9 @ ( X8 @ X9 ) ) )
& ? [X10: b] :
( $true
= ( X9 @ X10 ) ) ) ),
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] :
( ( ( X1 @ X2 @ X3 @ X4 )
= $true )
| ( ( X0 @ X2 @ X3 @ X4 )
= $true ) )
=> ? [X5: ( b > $o ) > b] :
! [X7: b > $o,X6: b] :
( ( $true
= ( X1 @ X7 @ ( X5 @ X7 ) @ X6 ) )
| ( $true
= ( X0 @ X7 @ ( X5 @ X7 ) @ X6 ) ) ) )
=> ? [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,X7: b > $o] :
( ( X0 @ X7 @ ( X5 @ X7 ) @ X6 )
| ( X1 @ X7 @ ( X5 @ X7 ) @ X6 ) ) )
=> ? [X8: ( b > $o ) > b] :
! [X9: b > $o] :
( ? [X10: b] : ( X9 @ X10 )
=> ( X9 @ ( X8 @ X9 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ! [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] :
! [X4: b,X2: b > $o] :
( ( 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,
( ! [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] :
! [X4: b,X2: b > $o] :
( ( 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/sandbox/benchmark/theBenchmark.p',cX5310_SUB2) ).
thf(f22,plain,
! [X0: b] :
( ( sK3 @ @@+ @ b @ X0 )
= $false ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
! [X0: b] :
( ( ( sK3 @ @@+ @ b @ X0 )
= $false )
| ( $true != $true ) ),
inference(superposition,[],[f15,f18]) ).
thf(f18,plain,
! [X0: ( b > $o ) > b,X1: b] :
( ( $true
= ( sK3 @ X0 @ ( @@+ @ b @ ( sK3 @ X0 ) ) ) )
| ( ( sK3 @ X0 @ X1 )
= $false ) ),
introduced(choice_axiom,[]) ).
thf(f15,plain,
! [X8: ( b > $o ) > b] :
( $true
!= ( sK3 @ X8 @ ( X8 @ ( sK3 @ X8 ) ) ) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL739^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/0.13 % 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.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 01:05:22 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34 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.36 % (18302)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.36 % (18304)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.36 % (18303)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.36 % (18305)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.36 % (18306)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.36 % (18307)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.36 % (18303)Instruction limit reached!
% 0.13/0.36 % (18303)------------------------------
% 0.13/0.36 % (18303)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (18303)Termination reason: Unknown
% 0.13/0.36 % (18303)Termination phase: Property scanning
% 0.13/0.36 % (18304)Instruction limit reached!
% 0.13/0.36 % (18304)------------------------------
% 0.13/0.36 % (18304)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (18304)Termination reason: Unknown
% 0.13/0.36 % (18304)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (18304)Memory used [KB]: 895
% 0.13/0.36 % (18304)Time elapsed: 0.003 s
% 0.13/0.36 % (18304)Instructions burned: 2 (million)
% 0.13/0.36 % (18304)------------------------------
% 0.13/0.36 % (18304)------------------------------
% 0.13/0.36
% 0.13/0.36 % (18303)Memory used [KB]: 895
% 0.13/0.36 % (18303)Time elapsed: 0.003 s
% 0.13/0.36 % (18303)Instructions burned: 2 (million)
% 0.13/0.36 % (18303)------------------------------
% 0.13/0.36 % (18303)------------------------------
% 0.13/0.36 % (18300)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 % (18307)Instruction limit reached!
% 0.13/0.37 % (18307)------------------------------
% 0.13/0.37 % (18307)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (18307)Termination reason: Unknown
% 0.13/0.37 % (18307)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (18307)Memory used [KB]: 5500
% 0.13/0.37 % (18307)Time elapsed: 0.004 s
% 0.13/0.37 % (18307)Instructions burned: 3 (million)
% 0.13/0.37 % (18307)------------------------------
% 0.13/0.37 % (18307)------------------------------
% 0.13/0.37 % (18302)First to succeed.
% 0.13/0.37 % (18302)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.37 % (18302)------------------------------
% 0.13/0.37 % (18302)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (18302)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (18302)Memory used [KB]: 5500
% 0.13/0.37 % (18302)Time elapsed: 0.007 s
% 0.13/0.37 % (18302)Instructions burned: 4 (million)
% 0.13/0.37 % (18302)------------------------------
% 0.13/0.37 % (18302)------------------------------
% 0.13/0.37 % (18299)Success in time 0.007 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------