TSTP Solution File: NUM655^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM655^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n015.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:44:16 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 30 ( 9 unt; 6 typ; 0 def)
% Number of atoms : 87 ( 37 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 106 ( 27 ~; 9 |; 1 &; 56 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 ^ 14 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
y: nat ).
thf(func_def_3,type,
less: nat > nat > $o ).
thf(func_def_5,type,
more: nat > nat > $o ).
thf(f32,plain,
$false,
inference(subsumption_resolution,[],[f31,f26]) ).
thf(f26,plain,
x != y,
inference(cnf_transformation,[],[f19]) ).
thf(f19,plain,
( ( ( more @ x @ y )
!= $true )
& ( x != y ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f16,plain,
~ ( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(flattening,[],[f10]) ).
thf(f10,plain,
~ ( ( ( more @ x @ y )
!= $true )
=> ( x = y ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
~ ( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ( ~ ( more @ x @ y )
=> ( x = y ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
( ~ ( more @ x @ y )
=> ( x = y ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10f) ).
thf(f31,plain,
x = y,
inference(subsumption_resolution,[],[f30,f25]) ).
thf(f25,plain,
( ( less @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( less @ x @ y )
!= $true ),
inference(flattening,[],[f8]) ).
thf(f8,plain,
( ( less @ x @ y )
!= $true ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ ( less @ x @ y ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
~ ( less @ x @ y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',n) ).
thf(f30,plain,
( ( ( less @ x @ y )
= $true )
| ( x = y ) ),
inference(trivial_inequality_removal,[],[f29]) ).
thf(f29,plain,
( ( ( less @ x @ y )
= $true )
| ( $true != $true )
| ( x = y ) ),
inference(superposition,[],[f27,f23]) ).
thf(f23,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( more @ X1 @ X0 ) )
| ( $true
= ( less @ X1 @ X0 ) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( less @ X1 @ X0 ) )
| ( $true
= ( more @ X1 @ X0 ) )
| ( X0 = X1 ) ),
inference(flattening,[],[f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( $true
= ( less @ X1 @ X0 ) )
| ( $true
= ( more @ X1 @ X0 ) )
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f18]) ).
thf(f18,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ( $true
!= ( more @ X1 @ X0 ) )
=> ( $true
= ( less @ X1 @ X0 ) ) ) ),
inference(flattening,[],[f14]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ( $true
!= ( more @ X1 @ X0 ) )
=> ( $true
= ( less @ X1 @ X0 ) ) ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
! [X0: nat,X1: nat] :
( ( X0 != X1 )
=> ( ~ ( more @ X1 @ X0 )
=> ( less @ X1 @ X0 ) ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X2: nat,X1: nat] :
( ( X1 != X2 )
=> ( ~ ( more @ X1 @ X2 )
=> ( less @ X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz10a) ).
thf(f27,plain,
( ( more @ x @ y )
!= $true ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUM655^1 : TPTP v8.2.0. Released v3.7.0.
% 0.10/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 03:42:38 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a TH0_THM_EQU_NAR problem
% 0.11/0.33 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/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35 % (16985)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.11/0.35 % (16983)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.11/0.35 % (16986)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.11/0.35 % (16984)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.11/0.35 % (16987)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.11/0.35 % (16989)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.11/0.35 % (16988)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.11/0.35 % (16985)Instruction limit reached!
% 0.11/0.35 % (16985)------------------------------
% 0.11/0.35 % (16985)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (16985)Termination reason: Unknown
% 0.11/0.35 % (16985)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (16986)Instruction limit reached!
% 0.11/0.35 % (16986)------------------------------
% 0.11/0.35 % (16986)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (16985)Memory used [KB]: 5500
% 0.11/0.35 % (16985)Time elapsed: 0.003 s
% 0.11/0.35 % (16985)Instructions burned: 2 (million)
% 0.11/0.35 % (16985)------------------------------
% 0.11/0.35 % (16985)------------------------------
% 0.11/0.35 % (16987)Refutation not found, incomplete strategy
% 0.11/0.35 % (16987)------------------------------
% 0.11/0.35 % (16987)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (16986)Termination reason: Unknown
% 0.11/0.35 % (16986)Termination phase: Saturation
% 0.11/0.35
% 0.11/0.35 % (16986)Memory used [KB]: 5500
% 0.11/0.35 % (16986)Time elapsed: 0.003 s
% 0.11/0.35 % (16986)Instructions burned: 2 (million)
% 0.11/0.35 % (16986)------------------------------
% 0.11/0.35 % (16986)------------------------------
% 0.11/0.35 % (16987)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.35
% 0.11/0.35
% 0.11/0.35 % (16987)Memory used [KB]: 5500
% 0.11/0.35 % (16987)Time elapsed: 0.003 s
% 0.11/0.35 % (16987)Instructions burned: 1 (million)
% 0.11/0.35 % (16987)------------------------------
% 0.11/0.35 % (16987)------------------------------
% 0.11/0.35 % (16989)First to succeed.
% 0.11/0.35 % (16982)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.11/0.35 % (16988)Also succeeded, but the first one will report.
% 0.11/0.35 % (16989)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for theBenchmark
% 0.11/0.35 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.35 % (16989)------------------------------
% 0.11/0.35 % (16989)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (16989)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (16989)Memory used [KB]: 5500
% 0.11/0.35 % (16989)Time elapsed: 0.003 s
% 0.11/0.35 % (16989)Instructions burned: 2 (million)
% 0.11/0.35 % (16989)------------------------------
% 0.11/0.35 % (16989)------------------------------
% 0.11/0.35 % (16981)Success in time 0.015 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------