TSTP Solution File: NUM730^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM730^1 : TPTP v8.2.0. Released v3.7.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 : n010.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 01:45:16 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 25 ( 6 unt; 14 typ; 0 def)
% Number of atoms : 51 ( 15 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 219 ( 5 ~; 0 |; 0 &; 214 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 13 ( 13 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 8 ( 0 ^ 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
frac: $tType ).
thf(type_def_7,type,
nat: $tType ).
thf(func_def_0,type,
frac: $tType ).
thf(func_def_1,type,
x: frac ).
thf(func_def_2,type,
y: frac ).
thf(func_def_3,type,
orec3: $o > $o > $o > $o ).
thf(func_def_4,type,
nat: $tType ).
thf(func_def_5,type,
ts: nat > nat > nat ).
thf(func_def_6,type,
c1x: frac > nat ).
thf(func_def_7,type,
c2y: frac > nat ).
thf(func_def_8,type,
c1y: frac > nat ).
thf(func_def_9,type,
c2x: frac > nat ).
thf(func_def_10,type,
more: nat > nat > $o ).
thf(func_def_11,type,
less: nat > nat > $o ).
thf(f12,plain,
$false,
inference(subsumption_resolution,[],[f11,f10]) ).
thf(f10,plain,
! [X0: nat,X1: nat] :
( ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
= $true ),
inference(cnf_transformation,[],[f6]) ).
thf(f6,plain,
! [X0: nat,X1: nat] :
( ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) )
= $true ),
inference(fool_elimination,[],[f5]) ).
thf(f5,plain,
! [X0: nat,X1: nat] : ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: nat,X1: nat] : ( orec3 @ ( X0 = X1 ) @ ( more @ X0 @ X1 ) @ ( less @ X0 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz10) ).
thf(f11,plain,
( $true
!= ( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
inference(cnf_transformation,[],[f9]) ).
thf(f9,plain,
( $true
!= ( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
( $true
!= ( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,negated_conjecture,
~ ( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
inference(negated_conjecture,[],[f2]) ).
thf(f2,conjecture,
( orec3
@ ( ( ts @ ( c1x @ x ) @ ( c2y @ y ) )
= ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( more @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) )
@ ( less @ ( ts @ ( c1x @ x ) @ ( c2y @ y ) ) @ ( ts @ ( c1y @ y ) @ ( c2x @ x ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz41) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM730^1 : TPTP v8.2.0. Released v3.7.0.
% 0.10/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.12/0.34 % Computer : n010.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 06:10:52 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 This is a TH0_THM_EQU_NAR problem
% 0.12/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.12/0.36 % (1218)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.12/0.36 % (1219)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.12/0.36 % (1216)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.12/0.36 % (1215)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.12/0.36 % (1213)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.12/0.36 % (1214)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.12/0.36 % (1217)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.12/0.36 % (1220)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.12/0.36 % (1216)Instruction limit reached!
% 0.12/0.36 % (1216)------------------------------
% 0.12/0.36 % (1216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (1216)Termination reason: Unknown
% 0.12/0.36 % (1216)Termination phase: Property scanning
% 0.12/0.36
% 0.12/0.36 % (1217)Instruction limit reached!
% 0.12/0.36 % (1217)------------------------------
% 0.12/0.36 % (1217)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (1217)Termination reason: Unknown
% 0.12/0.36 % (1217)Termination phase: Property scanning
% 0.12/0.36
% 0.12/0.36 % (1217)Memory used [KB]: 895
% 0.12/0.36 % (1217)Time elapsed: 0.002 s
% 0.12/0.36 % (1217)Instructions burned: 2 (million)
% 0.12/0.36 % (1217)------------------------------
% 0.12/0.36 % (1217)------------------------------
% 0.12/0.36 % (1216)Memory used [KB]: 895
% 0.12/0.36 % (1216)Time elapsed: 0.002 s
% 0.12/0.36 % (1216)Instructions burned: 2 (million)
% 0.12/0.36 % (1216)------------------------------
% 0.12/0.36 % (1216)------------------------------
% 0.12/0.36 % (1213)First to succeed.
% 0.12/0.36 % (1218)Refutation not found, incomplete strategy
% 0.12/0.36 % (1218)------------------------------
% 0.12/0.36 % (1218)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (1218)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % (1218)Memory used [KB]: 5500
% 0.12/0.36 % (1218)Time elapsed: 0.003 s
% 0.12/0.36 % (1218)Instructions burned: 2 (million)
% 0.12/0.36 % (1218)------------------------------
% 0.12/0.36 % (1218)------------------------------
% 0.12/0.36 % (1215)Refutation not found, incomplete strategy
% 0.12/0.36 % (1215)------------------------------
% 0.12/0.36 % (1215)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (1215)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.36
% 0.12/0.36
% 0.12/0.36 % (1215)Memory used [KB]: 5500
% 0.12/0.36 % (1215)Time elapsed: 0.003 s
% 0.12/0.36 % (1215)Instructions burned: 2 (million)
% 0.12/0.36 % (1215)------------------------------
% 0.12/0.36 % (1215)------------------------------
% 0.12/0.36 % (1214)Also succeeded, but the first one will report.
% 0.12/0.36 % (1213)Refutation found. Thanks to Tanya!
% 0.12/0.36 % SZS status Theorem for theBenchmark
% 0.12/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.36 % (1213)------------------------------
% 0.12/0.36 % (1213)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.12/0.36 % (1213)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (1213)Memory used [KB]: 5373
% 0.12/0.36 % (1213)Time elapsed: 0.003 s
% 0.12/0.36 % (1213)Instructions burned: 1 (million)
% 0.12/0.36 % (1213)------------------------------
% 0.12/0.36 % (1213)------------------------------
% 0.12/0.36 % (1212)Success in time 0.007 s
% 0.12/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------