TSTP Solution File: NUM771^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM771^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 : 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:45:51 EDT 2024
% Result : Theorem 0.16s 0.32s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 27 ( 16 unt; 11 typ; 0 def)
% Number of atoms : 30 ( 10 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 203 ( 7 ~; 0 |; 0 &; 196 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 0 ^ 10 !; 0 ?; 10 :)
% 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,
eq: frac > frac > $o ).
thf(func_def_4,type,
nat: $tType ).
thf(func_def_5,type,
fr: nat > nat > frac ).
thf(func_def_6,type,
ts: nat > nat > nat ).
thf(func_def_7,type,
num: frac > nat ).
thf(func_def_8,type,
den: frac > nat ).
thf(f17,plain,
$false,
inference(subsumption_resolution,[],[f16,f13]) ).
thf(f13,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(cnf_transformation,[],[f7]) ).
thf(f7,plain,
! [X0: frac] :
( ( eq @ X0 @ X0 )
= $true ),
inference(fool_elimination,[],[f6]) ).
thf(f6,plain,
! [X0: frac] : ( eq @ X0 @ X0 ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: frac] : ( eq @ X0 @ X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz37) ).
thf(f16,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) )
!= $true ),
inference(forward_demodulation,[],[f15,f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( ts @ X0 @ X1 )
= ( ts @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: nat,X1: nat] :
( ( ts @ X0 @ X1 )
= ( ts @ X1 @ X0 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X1: nat,X0: nat] :
( ( ts @ X0 @ X1 )
= ( ts @ X1 @ X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz29) ).
thf(f15,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
!= $true ),
inference(backward_demodulation,[],[f14,f12]) ).
thf(f14,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
!= $true ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
!= $true ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
( ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) )
!= $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
~ ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ ( eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
eq @ ( fr @ ( ts @ ( num @ x ) @ ( num @ y ) ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ) @ ( fr @ ( ts @ ( num @ y ) @ ( num @ x ) ) @ ( ts @ ( den @ y ) @ ( den @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz69) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : NUM771^1 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.11 % 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.11/0.31 % Computer : n015.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon May 20 06:29:38 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a TH0_THM_EQU_NAR problem
% 0.16/0.31 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.32 % (30271)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.16/0.32 % (30275)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.16/0.32 % (30270)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.16/0.32 % (30275)First to succeed.
% 0.16/0.32 % (30273)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.16/0.32 % (30275)Refutation found. Thanks to Tanya!
% 0.16/0.32 % SZS status Theorem for theBenchmark
% 0.16/0.32 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.32 % (30275)------------------------------
% 0.16/0.32 % (30275)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32 % (30275)Termination reason: Refutation
% 0.16/0.32
% 0.16/0.32 % (30275)Memory used [KB]: 5500
% 0.16/0.32 % (30275)Time elapsed: 0.003 s
% 0.16/0.32 % (30275)Instructions burned: 2 (million)
% 0.16/0.32 % (30275)------------------------------
% 0.16/0.32 % (30275)------------------------------
% 0.16/0.32 % (30267)Success in time 0.009 s
% 0.16/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------