TSTP Solution File: NUM692^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM692^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 : n007.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:49 EDT 2024
% Result : Theorem 0.24s 0.40s
% Output : Refutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 53 ( 19 unt; 9 typ; 0 def)
% Number of atoms : 187 ( 55 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 277 ( 26 ~; 21 |; 0 &; 218 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 0 ^ 56 !; 0 ?; 56 :)
% 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,
z: nat ).
thf(func_def_4,type,
u: nat ).
thf(func_def_5,type,
lessis: nat > nat > $o ).
thf(func_def_7,type,
ts: nat > nat > nat ).
thf(func_def_8,type,
moreis: nat > nat > $o ).
thf(f57,plain,
$false,
inference(subsumption_resolution,[],[f55,f31]) ).
thf(f31,plain,
( ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) )
!= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) )
!= $true ),
inference(flattening,[],[f18]) ).
thf(f18,plain,
( ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) )
!= $true ),
inference(fool_elimination,[],[f17]) ).
thf(f17,plain,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(rectify,[],[f7]) ).
thf(f7,negated_conjecture,
~ ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) ),
inference(negated_conjecture,[],[f6]) ).
thf(f6,conjecture,
lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23a) ).
thf(f55,plain,
( ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) )
= $true ),
inference(trivial_inequality_removal,[],[f53]) ).
thf(f53,plain,
( ( $true != $true )
| ( ( lessis @ ( ts @ x @ z ) @ ( ts @ y @ u ) )
= $true ) ),
inference(superposition,[],[f33,f49]) ).
thf(f49,plain,
( ( moreis @ ( ts @ y @ u ) @ ( ts @ x @ z ) )
= $true ),
inference(trivial_inequality_removal,[],[f48]) ).
thf(f48,plain,
( ( $true != $true )
| ( ( moreis @ ( ts @ y @ u ) @ ( ts @ x @ z ) )
= $true ) ),
inference(superposition,[],[f45,f38]) ).
thf(f38,plain,
( ( moreis @ y @ x )
= $true ),
inference(trivial_inequality_removal,[],[f35]) ).
thf(f35,plain,
( ( ( moreis @ y @ x )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f30,f29]) ).
thf(f29,plain,
( ( lessis @ x @ y )
= $true ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
( ( lessis @ x @ y )
= $true ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
lessis @ x @ y,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
lessis @ x @ y,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
thf(f30,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(rectify,[],[f25]) ).
thf(f25,plain,
! [X1: nat,X0: nat] :
( ( ( lessis @ X1 @ X0 )
!= $true )
| ( ( moreis @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
! [X1: nat,X0: nat] :
( ( ( lessis @ X1 @ X0 )
= $true )
=> ( ( moreis @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: nat,X1: nat] :
( ( lessis @ X1 @ X0 )
=> ( moreis @ X0 @ X1 ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X1: nat,X0: nat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz14) ).
thf(f45,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( moreis @ ( ts @ X0 @ u ) @ ( ts @ X1 @ z ) )
= $true ) ),
inference(trivial_inequality_removal,[],[f43]) ).
thf(f43,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( moreis @ ( ts @ X0 @ u ) @ ( ts @ X1 @ z ) )
= $true )
| ( $true != $true ) ),
inference(superposition,[],[f34,f37]) ).
thf(f37,plain,
( $true
= ( moreis @ u @ z ) ),
inference(trivial_inequality_removal,[],[f36]) ).
thf(f36,plain,
( ( $true != $true )
| ( $true
= ( moreis @ u @ z ) ) ),
inference(superposition,[],[f30,f32]) ).
thf(f32,plain,
( ( lessis @ z @ u )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( lessis @ z @ u )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
lessis @ z @ u,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
lessis @ z @ u,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',k) ).
thf(f34,plain,
! [X2: nat,X3: nat,X0: nat,X1: nat] :
( ( ( moreis @ X3 @ X2 )
!= $true )
| ( ( moreis @ ( ts @ X0 @ X3 ) @ ( ts @ X1 @ X2 ) )
= $true )
| ( ( moreis @ X0 @ X1 )
!= $true ) ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( ( moreis @ ( ts @ X0 @ X3 ) @ ( ts @ X1 @ X2 ) )
= $true )
| ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X3 @ X2 )
!= $true ) ),
inference(rectify,[],[f23]) ).
thf(f23,plain,
! [X1: nat,X3: nat,X0: nat,X2: nat] :
( ( ( moreis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X0 ) )
= $true )
| ( $true
!= ( moreis @ X1 @ X3 ) )
| ( ( moreis @ X2 @ X0 )
!= $true ) ),
inference(flattening,[],[f22]) ).
thf(f22,plain,
! [X3: nat,X2: nat,X1: nat,X0: nat] :
( ( ( moreis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X0 ) )
= $true )
| ( ( moreis @ X2 @ X0 )
!= $true )
| ( $true
!= ( moreis @ X1 @ X3 ) ) ),
inference(ennf_transformation,[],[f16]) ).
thf(f16,plain,
! [X3: nat,X2: nat,X1: nat,X0: nat] :
( ( $true
= ( moreis @ X1 @ X3 ) )
=> ( ( ( moreis @ X2 @ X0 )
= $true )
=> ( ( moreis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X0 ) )
= $true ) ) ),
inference(fool_elimination,[],[f15]) ).
thf(f15,plain,
! [X0: nat,X1: nat,X2: nat,X3: nat] :
( ( moreis @ X1 @ X3 )
=> ( ( moreis @ X2 @ X0 )
=> ( moreis @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X0 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X3: nat,X0: nat,X2: nat,X1: nat] :
( ( moreis @ X0 @ X1 )
=> ( ( moreis @ X2 @ X3 )
=> ( moreis @ ( ts @ X0 @ X2 ) @ ( ts @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz23) ).
thf(f33,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( lessis @ X1 @ X0 )
= $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
! [X0: nat,X1: nat] :
( ( ( lessis @ X1 @ X0 )
= $true )
| ( ( moreis @ X0 @ X1 )
!= $true ) ),
inference(rectify,[],[f24]) ).
thf(f24,plain,
! [X1: nat,X0: nat] :
( ( ( lessis @ X0 @ X1 )
= $true )
| ( ( moreis @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f20]) ).
thf(f20,plain,
! [X0: nat,X1: nat] :
( ( ( moreis @ X1 @ X0 )
= $true )
=> ( ( lessis @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f19]) ).
thf(f19,plain,
! [X0: nat,X1: nat] :
( ( moreis @ X1 @ X0 )
=> ( lessis @ X0 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X1: nat,X0: nat] :
( ( moreis @ X0 @ X1 )
=> ( lessis @ X1 @ X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',satz13) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM692^1 : TPTP v8.2.0. Released v3.7.0.
% 0.16/0.16 % 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.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Mon May 20 07:38:23 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a TH0_THM_NEQ_NAR problem
% 0.24/0.38 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.24/0.39 % (32242)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.24/0.40 % (32240)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.24/0.40 % (32241)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.24/0.40 % (32240)Instruction limit reached!
% 0.24/0.40 % (32240)------------------------------
% 0.24/0.40 % (32240)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (32240)Termination reason: Unknown
% 0.24/0.40 % (32240)Termination phase: Saturation
% 0.24/0.40
% 0.24/0.40 % (32240)Memory used [KB]: 895
% 0.24/0.40 % (32240)Time elapsed: 0.003 s
% 0.24/0.40 % (32240)Instructions burned: 2 (million)
% 0.24/0.40 % (32240)------------------------------
% 0.24/0.40 % (32240)------------------------------
% 0.24/0.40 % (32236)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.24/0.40 % (32242)First to succeed.
% 0.24/0.40 % (32237)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.24/0.40 % (32243)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.24/0.40 % (32241)Also succeeded, but the first one will report.
% 0.24/0.40 % (32242)Refutation found. Thanks to Tanya!
% 0.24/0.40 % SZS status Theorem for theBenchmark
% 0.24/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.40 % (32242)------------------------------
% 0.24/0.40 % (32242)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.24/0.40 % (32242)Termination reason: Refutation
% 0.24/0.40
% 0.24/0.40 % (32242)Memory used [KB]: 5500
% 0.24/0.40 % (32242)Time elapsed: 0.006 s
% 0.24/0.40 % (32242)Instructions burned: 5 (million)
% 0.24/0.40 % (32242)------------------------------
% 0.24/0.40 % (32242)------------------------------
% 0.24/0.40 % (32235)Success in time 0.019 s
% 0.24/0.40 % Vampire---4.8 exiting
%------------------------------------------------------------------------------