TSTP Solution File: NUM694^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM694^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n011.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 02:12:54 EDT 2024
% Result : Theorem 0.12s 0.36s
% Output : Refutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 36 ( 14 unt; 14 typ; 0 def)
% Number of atoms : 116 ( 20 equ; 0 cnn)
% Maximal formula atoms : 2 ( 5 avg)
% Number of connectives : 17 ( 9 ~; 5 |; 0 &; 0 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 22 ( 21 >; 1 *; 0 +; 0 <<)
% Number of symbols : 16 ( 13 usr; 4 con; 0-6 aty)
% Number of variables : 23 ( 0 ^ 17 !; 0 ?; 23 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
nat: $tType ).
thf(type_def_6,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
nat: $tType ).
thf(func_def_1,type,
x: nat ).
thf(func_def_2,type,
lessis: nat > nat > $o ).
thf(func_def_3,type,
n_1: nat ).
thf(func_def_4,type,
moreis: nat > nat > $o ).
thf(func_def_9,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_10,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_11,type,
vAND: $o > $o > $o ).
thf(func_def_12,type,
vOR: $o > $o > $o ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(func_def_15,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f57,plain,
$false,
inference(trivial_inequality_removal,[],[f56]) ).
thf(f56,plain,
$true = $false,
inference(superposition,[],[f47,f54]) ).
thf(f54,plain,
! [X0: nat] : ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),X0) ),
inference(trivial_inequality_removal,[],[f51]) ).
thf(f51,plain,
! [X0: nat] :
( ( $true != $true )
| ( $true = vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),X0) ) ),
inference(superposition,[],[f17,f16]) ).
thf(f16,plain,
! [X0: nat] : ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),n_1) = $true ),
inference(cnf_transformation,[],[f10]) ).
thf(f10,plain,
! [X0: nat] : ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),n_1) = $true ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
! [X0: nat] : vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),n_1),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: nat] : vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),n_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24) ).
thf(f17,plain,
! [X0: nat,X1: nat] :
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),X1) != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,X1),X0) = $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: nat,X1: nat] :
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,X1),X0) = $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),X1) != $true ) ),
inference(ennf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: nat,X1: nat] :
( ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),X1) = $true )
=> ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,X1),X0) = $true ) ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
! [X0: nat,X1: nat] :
( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),X1)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,X1),X0) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: nat,X1: nat] :
( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),moreis,X0),X1)
=> vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,X1),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz13) ).
thf(f47,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x) = $false,
inference(trivial_inequality_removal,[],[f46]) ).
thf(f46,plain,
( ( $true != $true )
| ( vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x) = $false ) ),
inference(superposition,[],[f15,f6]) ).
thf(f6,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f15,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x) != $true,
inference(cnf_transformation,[],[f13]) ).
thf(f13,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x) != $true,
inference(flattening,[],[f8]) ).
thf(f8,plain,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x) != $true,
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x),
inference(rectify,[],[f4]) ).
thf(f4,negated_conjecture,
~ vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
vAPP(nat,$o,vAPP(nat,sTfun(nat,$o),lessis,n_1),x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz24a) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM694^1 : TPTP v8.2.0. Released v3.7.0.
% 0.06/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.12/0.34 % Computer : n011.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 07:15:38 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % (16572)Running in auto input_syntax mode. Trying TPTP
% 0.12/0.36 % (16575)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.12/0.36 % (16576)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.12/0.36 % (16574)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.12/0.36 % (16575)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.36 % (16576)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.12/0.36 % (16579)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % (16573)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % Exception at run slice level
% 0.12/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.12/0.36 % (16577)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.12/0.36 % (16578)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.12/0.36 % (16575)First to succeed.
% 0.12/0.36 % (16575)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16572"
% 0.12/0.36 % (16577)Also succeeded, but the first one will report.
% 0.12/0.36 % (16575)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 % (16575)------------------------------
% 0.12/0.36 % (16575)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.12/0.36 % (16575)Termination reason: Refutation
% 0.12/0.36
% 0.12/0.36 % (16575)Memory used [KB]: 766
% 0.12/0.36 % (16575)Time elapsed: 0.005 s
% 0.12/0.36 % (16575)Instructions burned: 4 (million)
% 0.12/0.36 % (16572)Success in time 0.016 s
%------------------------------------------------------------------------------