TSTP Solution File: SEV059^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV059^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 : n019.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:11:52 EDT 2024
% Result : Theorem 0.22s 0.41s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 7 unt; 9 typ; 0 def)
% Number of atoms : 167 ( 57 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 312 ( 31 ~; 14 |; 27 &; 229 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 62 ( 11 ^ 47 !; 4 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
b: $tType ).
thf(type_def_7,type,
a: $tType ).
thf(func_def_0,type,
b: $tType ).
thf(func_def_1,type,
a: $tType ).
thf(func_def_2,type,
cG: b > b ).
thf(func_def_3,type,
cA: b > a ).
thf(func_def_4,type,
c_less_: a > a > $o ).
thf(func_def_5,type,
cF: b > b ).
thf(func_def_11,type,
sK0: b ).
thf(f24,plain,
$false,
inference(subsumption_resolution,[],[f23,f13]) ).
thf(f13,plain,
! [X1: b] :
( ( c_less_ @ ( cA @ X1 ) @ ( cA @ ( cF @ X1 ) ) )
= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ( $true
!= ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cG @ sK0 ) ) ) )
& ! [X1: b] :
( ( c_less_ @ ( cA @ X1 ) @ ( cA @ ( cF @ X1 ) ) )
= $true )
& ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( c_less_ @ X2 @ X4 ) )
| ( ( c_less_ @ X4 @ X3 )
!= $true )
| ( ( c_less_ @ X2 @ X3 )
= $true ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f9,f10]) ).
thf(f10,plain,
( ? [X0: b] :
( $true
!= ( c_less_ @ ( cA @ X0 ) @ ( cA @ ( cG @ X0 ) ) ) )
=> ( $true
!= ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cG @ sK0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f9,plain,
( ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ? [X0: b] :
( $true
!= ( c_less_ @ ( cA @ X0 ) @ ( cA @ ( cG @ X0 ) ) ) )
& ! [X1: b] :
( ( c_less_ @ ( cA @ X1 ) @ ( cA @ ( cF @ X1 ) ) )
= $true )
& ! [X2: a,X3: a,X4: a] :
( ( $true
!= ( c_less_ @ X2 @ X4 ) )
| ( ( c_less_ @ X4 @ X3 )
!= $true )
| ( ( c_less_ @ X2 @ X3 )
= $true ) ) ),
inference(rectify,[],[f8]) ).
thf(f8,plain,
( ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ? [X4: b] :
( $true
!= ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cG @ X4 ) ) ) )
& ! [X3: b] :
( ( c_less_ @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ! [X0: a,X1: a,X2: a] :
( ( ( c_less_ @ X0 @ X2 )
!= $true )
| ( ( c_less_ @ X2 @ X1 )
!= $true )
| ( ( c_less_ @ X0 @ X1 )
= $true ) ) ),
inference(flattening,[],[f7]) ).
thf(f7,plain,
( ? [X4: b] :
( $true
!= ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cG @ X4 ) ) ) )
& ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ! [X3: b] :
( ( c_less_ @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ! [X0: a,X1: a,X2: a] :
( ( ( c_less_ @ X0 @ X1 )
= $true )
| ( ( c_less_ @ X2 @ X1 )
!= $true )
| ( ( c_less_ @ X0 @ X2 )
!= $true ) ) ),
inference(ennf_transformation,[],[f6]) ).
thf(f6,plain,
~ ( ( ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ! [X3: b] :
( ( c_less_ @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) )
= $true )
& ! [X0: a,X1: a,X2: a] :
( ( ( ( c_less_ @ X2 @ X1 )
= $true )
& ( ( c_less_ @ X0 @ X2 )
= $true ) )
=> ( ( c_less_ @ X0 @ X1 )
= $true ) ) )
=> ! [X4: b] :
( $true
= ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cG @ X4 ) ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,plain,
~ ( ( ! [X0: a,X1: a,X2: a] :
( ( ( ( c_less_ @ X2 @ X1 )
= $true )
& ( ( c_less_ @ X0 @ X2 )
= $true ) )
=> ( ( c_less_ @ X0 @ X1 )
= $true ) )
& ( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) )
& ! [X4: b] :
( ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) )
= $true ) )
=> ! [X5: b] :
( ( c_less_ @ ( cA @ X5 ) @ ( cA @ ( cG @ X5 ) ) )
= $true ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ( ( ! [X0: a,X1: a,X2: a] :
( ( ( c_less_ @ X2 @ X1 )
& ( c_less_ @ X0 @ X2 ) )
=> ( c_less_ @ X0 @ X1 ) )
& ( cG
= ( ^ [X3: b] : ( cF @ ( cF @ X3 ) ) ) )
& ! [X4: b] : ( c_less_ @ ( cA @ X4 ) @ ( cA @ ( cF @ X4 ) ) ) )
=> ! [X5: b] : ( c_less_ @ ( cA @ X5 ) @ ( cA @ ( cG @ X5 ) ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ( ( ! [X0: a,X2: a,X1: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X0 @ X1 ) )
=> ( c_less_ @ X0 @ X2 ) )
& ( cG
= ( ^ [X4: b] : ( cF @ ( cF @ X4 ) ) ) )
& ! [X3: b] : ( c_less_ @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) ) )
=> ! [X5: b] : ( c_less_ @ ( cA @ X5 ) @ ( cA @ ( cG @ X5 ) ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
( ( ! [X0: a,X2: a,X1: a] :
( ( ( c_less_ @ X1 @ X2 )
& ( c_less_ @ X0 @ X1 ) )
=> ( c_less_ @ X0 @ X2 ) )
& ( cG
= ( ^ [X4: b] : ( cF @ ( cF @ X4 ) ) ) )
& ! [X3: b] : ( c_less_ @ ( cA @ X3 ) @ ( cA @ ( cF @ X3 ) ) ) )
=> ! [X5: b] : ( c_less_ @ ( cA @ X5 ) @ ( cA @ ( cG @ X5 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM89A_pme) ).
thf(f23,plain,
( ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) )
!= $true ),
inference(trivial_inequality_removal,[],[f20]) ).
thf(f20,plain,
( ( $true != $true )
| ( ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cF @ sK0 ) ) )
!= $true ) ),
inference(superposition,[],[f19,f13]) ).
thf(f19,plain,
! [X0: a] :
( ( $true
!= ( c_less_ @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) )
| ( ( c_less_ @ ( cA @ sK0 ) @ X0 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f18]) ).
thf(f18,plain,
! [X0: a] :
( ( ( c_less_ @ ( cA @ sK0 ) @ X0 )
!= $true )
| ( $true
!= ( c_less_ @ X0 @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f17,f12]) ).
thf(f12,plain,
! [X2: a,X3: a,X4: a] :
( ( ( c_less_ @ X2 @ X3 )
= $true )
| ( ( c_less_ @ X4 @ X3 )
!= $true )
| ( $true
!= ( c_less_ @ X2 @ X4 ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f17,plain,
( ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cF @ ( cF @ sK0 ) ) ) )
!= $true ),
inference(beta_eta_normalization,[],[f16]) ).
thf(f16,plain,
( ( c_less_ @ ( cA @ sK0 )
@ ( cA
@ ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) )
@ sK0 ) ) )
!= $true ),
inference(definition_unfolding,[],[f14,f15]) ).
thf(f15,plain,
( cG
= ( ^ [Y0: b] : ( cF @ ( cF @ Y0 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
thf(f14,plain,
( $true
!= ( c_less_ @ ( cA @ sK0 ) @ ( cA @ ( cG @ sK0 ) ) ) ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEV059^5 : TPTP v8.2.0. Released v4.0.0.
% 0.15/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 : n019.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 : Sun May 19 19:05:23 EDT 2024
% 0.22/0.36 % CPUTime :
% 0.22/0.37 This is a TH0_THM_EQU_NAR problem
% 0.22/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.22/0.40 % (23311)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.40 % (23312)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 (2999ds/2Mi)
% 0.22/0.40 % (23308)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.22/0.40 % (23310)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 (2999ds/27Mi)
% 0.22/0.40 % (23309)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 (2999ds/4Mi)
% 0.22/0.40 % (23311)Instruction limit reached!
% 0.22/0.40 % (23311)------------------------------
% 0.22/0.40 % (23311)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (23311)Termination reason: Unknown
% 0.22/0.40 % (23311)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (23311)Memory used [KB]: 5373
% 0.22/0.40 % (23311)Time elapsed: 0.004 s
% 0.22/0.40 % (23311)Instructions burned: 2 (million)
% 0.22/0.40 % (23311)------------------------------
% 0.22/0.40 % (23311)------------------------------
% 0.22/0.40 % (23315)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.22/0.40 % (23313)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 (2999ds/275Mi)
% 0.22/0.40 % (23312)Instruction limit reached!
% 0.22/0.40 % (23312)------------------------------
% 0.22/0.40 % (23312)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (23312)Termination reason: Unknown
% 0.22/0.40 % (23312)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (23312)Memory used [KB]: 5500
% 0.22/0.40 % (23312)Time elapsed: 0.004 s
% 0.22/0.40 % (23312)Instructions burned: 2 (million)
% 0.22/0.40 % (23312)------------------------------
% 0.22/0.40 % (23312)------------------------------
% 0.22/0.40 % (23316)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.22/0.40 % (23308)First to succeed.
% 0.22/0.40 % (23316)Instruction limit reached!
% 0.22/0.40 % (23316)------------------------------
% 0.22/0.40 % (23316)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (23316)Termination reason: Unknown
% 0.22/0.40 % (23316)Termination phase: Saturation
% 0.22/0.40 % (23309)Instruction limit reached!
% 0.22/0.40 % (23309)------------------------------
% 0.22/0.40 % (23309)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.40 % (23309)Termination reason: Unknown
% 0.22/0.40 % (23309)Termination phase: Saturation
% 0.22/0.40
% 0.22/0.40 % (23309)Memory used [KB]: 5500
% 0.22/0.40 % (23309)Time elapsed: 0.008 s
% 0.22/0.40 % (23309)Instructions burned: 4 (million)
% 0.22/0.40 % (23309)------------------------------
% 0.22/0.40 % (23309)------------------------------
% 0.22/0.40
% 0.22/0.40 % (23316)Memory used [KB]: 5500
% 0.22/0.40 % (23316)Time elapsed: 0.006 s
% 0.22/0.40 % (23316)Instructions burned: 3 (million)
% 0.22/0.40 % (23313)Also succeeded, but the first one will report.
% 0.22/0.40 % (23316)------------------------------
% 0.22/0.40 % (23316)------------------------------
% 0.22/0.41 % (23308)Refutation found. Thanks to Tanya!
% 0.22/0.41 % SZS status Theorem for theBenchmark
% 0.22/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.41 % (23308)------------------------------
% 0.22/0.41 % (23308)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.22/0.41 % (23308)Termination reason: Refutation
% 0.22/0.41
% 0.22/0.41 % (23308)Memory used [KB]: 5500
% 0.22/0.41 % (23308)Time elapsed: 0.007 s
% 0.22/0.41 % (23308)Instructions burned: 3 (million)
% 0.22/0.41 % (23308)------------------------------
% 0.22/0.41 % (23308)------------------------------
% 0.22/0.41 % (23307)Success in time 0.03 s
% 0.22/0.41 % Vampire---4.8 exiting
%------------------------------------------------------------------------------