TSTP Solution File: SEV494^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV494^1 : TPTP v8.2.0. Released v7.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 : n028.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:13:59 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 7 unt; 14 typ; 0 def)
% Number of atoms : 106 ( 29 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 246 ( 11 ~; 3 |; 4 &; 220 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 26 ( 0 ^ 20 !; 4 ?; 26 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/nums/num': $tType ).
thf(func_def_0,type,
'type/nums/num': $tType ).
thf(func_def_1,type,
'const/sets/INSERT':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/nums/SUC': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_3,type,
'const/nums/NUMERAL': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_4,type,
'const/nums/BIT1': 'type/nums/num' > 'type/nums/num' ).
thf(func_def_5,type,
'const/nums/_0': 'type/nums/num' ).
thf(func_def_6,type,
'const/iterate/..': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_7,type,
'const/arith/-': 'type/nums/num' > 'type/nums/num' > 'type/nums/num' ).
thf(func_def_8,type,
'const/arith/<=': 'type/nums/num' > 'type/nums/num' > $o ).
thf(func_def_12,type,
sK0: 'type/nums/num' ).
thf(func_def_13,type,
sK1: 'type/nums/num' ).
thf(func_def_15,type,
ph3:
!>[X0: $tType] : X0 ).
thf(func_def_16,type,
sK4: 'type/nums/num' ).
thf(f46,plain,
$false,
inference(subsumption_resolution,[],[f45,f15]) ).
thf(f15,plain,
( ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ sK1 ) )
!= ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) ) ),
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
( ( ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ sK1 ) )
!= ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) ) )
& ( ( 'const/arith/<=' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) )
= $true ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f11,f12]) ).
thf(f12,plain,
( ? [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
!= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) )
& ( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= $true ) )
=> ( ( ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ sK1 ) )
!= ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) ) )
& ( ( 'const/arith/<=' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) )
= $true ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
? [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
!= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) )
& ( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= $true ) ),
inference(ennf_transformation,[],[f9]) ).
thf(f9,plain,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= $true )
=> ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) ) ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
=> ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
=> ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
=> ( ( 'const/iterate/..' @ X0 @ ( 'const/nums/SUC' @ X1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ X1 ) @ ( 'const/iterate/..' @ X0 @ X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NUMSEG_REC_') ).
thf(f45,plain,
( ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ sK1 ) )
= ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) ) ),
inference(forward_demodulation,[],[f44,f17]) ).
thf(f17,plain,
! [X0: 'type/nums/num'] :
( ( 'const/arith/-' @ ( 'const/nums/SUC' @ X0 ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) )
= X0 ),
inference(cnf_transformation,[],[f1]) ).
thf(f1,axiom,
! [X0: 'type/nums/num'] :
( ( 'const/arith/-' @ ( 'const/nums/SUC' @ X0 ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) )
= X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/arith/SUC_SUB1_') ).
thf(f44,plain,
( ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ ( 'const/arith/-' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
( ( ( 'const/iterate/..' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) )
= ( 'const/sets/INSERT' @ 'type/nums/num' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/iterate/..' @ sK0 @ ( 'const/arith/-' @ ( 'const/nums/SUC' @ sK1 ) @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f16,f14]) ).
thf(f14,plain,
( ( 'const/arith/<=' @ sK0 @ ( 'const/nums/SUC' @ sK1 ) )
= $true ),
inference(cnf_transformation,[],[f13]) ).
thf(f16,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/INSERT' @ 'type/nums/num' @ X1 @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ X1 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) )
= ( 'const/iterate/..' @ X0 @ X1 ) ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X1 )
!= $true )
| ( ( 'const/sets/INSERT' @ 'type/nums/num' @ X1 @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ X1 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) )
= ( 'const/iterate/..' @ X0 @ X1 ) ) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( ( 'const/arith/<=' @ X0 @ X1 )
= $true )
=> ( ( 'const/sets/INSERT' @ 'type/nums/num' @ X1 @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ X1 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) )
= ( 'const/iterate/..' @ X0 @ X1 ) ) ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X0 @ X1 )
=> ( ( 'const/sets/INSERT' @ 'type/nums/num' @ X1 @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ X1 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) )
= ( 'const/iterate/..' @ X0 @ X1 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: 'type/nums/num',X1: 'type/nums/num'] :
( ( 'const/arith/<=' @ X0 @ X1 )
=> ( ( 'const/sets/INSERT' @ 'type/nums/num' @ X1 @ ( 'const/iterate/..' @ X0 @ ( 'const/arith/-' @ X1 @ ( 'const/nums/NUMERAL' @ ( 'const/nums/BIT1' @ 'const/nums/_0' ) ) ) ) )
= ( 'const/iterate/..' @ X0 @ X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/NUMSEG_RREC_') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV494^1 : TPTP v8.2.0. Released v7.0.0.
% 0.07/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.16/0.36 % Computer : n028.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Sun May 19 18:55:38 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH1_THM_EQU_NAR problem
% 0.16/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/sandbox/benchmark/theBenchmark.p
% 0.16/0.38 % (15326)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.16/0.38 % (15327)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.16/0.38 % (15328)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.16/0.38 % (15329)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.16/0.38 % (15330)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.16/0.38 % (15331)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.16/0.38 % (15332)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.16/0.38 % (15333)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.16/0.38 % (15330)Instruction limit reached!
% 0.16/0.38 % (15330)------------------------------
% 0.16/0.38 % (15330)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (15330)Termination reason: Unknown
% 0.16/0.38 % (15330)Termination phase: Property scanning
% 0.16/0.38
% 0.16/0.38 % (15330)Memory used [KB]: 895
% 0.16/0.38 % (15330)Time elapsed: 0.003 s
% 0.16/0.38 % (15330)Instructions burned: 2 (million)
% 0.16/0.38 % (15330)------------------------------
% 0.16/0.38 % (15330)------------------------------
% 0.16/0.38 % (15329)Instruction limit reached!
% 0.16/0.38 % (15329)------------------------------
% 0.16/0.38 % (15329)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (15329)Termination reason: Unknown
% 0.16/0.38 % (15329)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (15329)Memory used [KB]: 5500
% 0.16/0.38 % (15329)Time elapsed: 0.004 s
% 0.16/0.38 % (15329)Instructions burned: 2 (million)
% 0.16/0.38 % (15329)------------------------------
% 0.16/0.38 % (15329)------------------------------
% 0.16/0.38 % (15331)Refutation not found, incomplete strategy
% 0.16/0.38 % (15331)------------------------------
% 0.16/0.38 % (15331)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (15331)Termination reason: Refutation not found, incomplete strategy
% 0.16/0.38
% 0.16/0.38
% 0.16/0.38 % (15331)Memory used [KB]: 5500
% 0.16/0.38 % (15331)Time elapsed: 0.005 s
% 0.16/0.38 % (15331)Instructions burned: 2 (million)
% 0.16/0.38 % (15331)------------------------------
% 0.16/0.38 % (15331)------------------------------
% 0.16/0.38 % (15333)Instruction limit reached!
% 0.16/0.38 % (15333)------------------------------
% 0.16/0.38 % (15333)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (15333)Termination reason: Unknown
% 0.16/0.38 % (15333)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (15333)Memory used [KB]: 5500
% 0.16/0.38 % (15333)Time elapsed: 0.005 s
% 0.16/0.38 % (15333)Instructions burned: 3 (million)
% 0.16/0.38 % (15333)------------------------------
% 0.16/0.38 % (15333)------------------------------
% 0.16/0.39 % (15327)Instruction limit reached!
% 0.16/0.39 % (15327)------------------------------
% 0.16/0.39 % (15327)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (15332)First to succeed.
% 0.16/0.39 % (15327)Termination reason: Unknown
% 0.16/0.39 % (15327)Termination phase: Saturation
% 0.16/0.39
% 0.16/0.39 % (15327)Memory used [KB]: 5500
% 0.16/0.39 % (15327)Time elapsed: 0.006 s
% 0.16/0.39 % (15327)Instructions burned: 5 (million)
% 0.16/0.39 % (15327)------------------------------
% 0.16/0.39 % (15327)------------------------------
% 0.16/0.39 % (15328)Also succeeded, but the first one will report.
% 0.16/0.39 % (15332)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39 % (15332)------------------------------
% 0.16/0.39 % (15332)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (15332)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (15332)Memory used [KB]: 5500
% 0.16/0.39 % (15332)Time elapsed: 0.006 s
% 0.16/0.39 % (15332)Instructions burned: 3 (million)
% 0.16/0.39 % (15332)------------------------------
% 0.16/0.39 % (15332)------------------------------
% 0.16/0.39 % (15325)Success in time 0.006 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------