TSTP Solution File: CSR135^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : CSR135^1 : TPTP v8.2.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Mon May 20 19:46:09 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 28 ( 10 unt; 11 typ; 0 def)
% Number of atoms : 126 ( 13 equ; 0 cnn)
% Maximal formula atoms : 2 ( 7 avg)
% Number of connectives : 17 ( 10 ~; 3 |; 4 &; 0 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 34 ( 33 >; 1 *; 0 +; 0 <<)
% Number of symbols : 17 ( 14 usr; 5 con; 0-6 aty)
% Number of variables : 12 ( 0 ^ 2 !; 4 ?; 12 :)
% ( 6 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(func_def_0,type,
num: $tType ).
thf(func_def_7,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_8,type,
parent_THFTYPE_IiioI: $i > $i > $o ).
thf(func_def_10,type,
vNOT: $o > $o ).
thf(func_def_13,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_14,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_15,type,
vAND: $o > $o > $o ).
thf(func_def_16,type,
vOR: $o > $o > $o ).
thf(func_def_17,type,
vIMP: $o > $o > $o ).
thf(func_def_18,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(f77,plain,
$false,
inference(subsumption_resolution,[],[f76,f38]) ).
thf(f38,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i) = $true,
inference(cnf_transformation,[],[f26]) ).
thf(f26,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i) = $true,
inference(fool_elimination,[],[f25]) ).
thf(f25,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002) ).
thf(f76,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i) != $true,
inference(trivial_inequality_removal,[],[f75]) ).
thf(f75,plain,
( ( $true != $true )
| ( vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lMary_THFTYPE_i),lBill_THFTYPE_i) != $true ) ),
inference(superposition,[],[f32,f39]) ).
thf(f39,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lSue_THFTYPE_i),lBill_THFTYPE_i) = $true,
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lSue_THFTYPE_i),lBill_THFTYPE_i) = $true,
inference(fool_elimination,[],[f27]) ).
thf(f27,plain,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lSue_THFTYPE_i),lBill_THFTYPE_i),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
vAPP($i,$o,vAPP($i,sTfun($i,$o),likes_THFTYPE_IiioI,lSue_THFTYPE_i),lBill_THFTYPE_i),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax) ).
thf(f32,plain,
! [X0: $i > $i > $o] :
( ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) != $true )
| ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i) != $true ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
! [X0: $i > $i > $o] :
( ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i) != $true )
| ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) != $true ) ),
inference(ennf_transformation,[],[f14]) ).
thf(f14,plain,
~ ? [X0: $i > $i > $o] :
( ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i) = $true )
& ( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) = $true ) ),
inference(fool_elimination,[],[f13]) ).
thf(f13,plain,
~ ? [X0: $i > $i > $o] :
( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i)
& vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) ),
inference(rectify,[],[f10]) ).
thf(f10,negated_conjecture,
~ ? [X0: $i > $i > $o] :
( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i)
& vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) ),
inference(negated_conjecture,[],[f9]) ).
thf(f9,conjecture,
? [X0: $i > $i > $o] :
( vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lMary_THFTYPE_i),lBill_THFTYPE_i)
& vAPP($i,$o,vAPP($i,sTfun($i,$o),X0,lSue_THFTYPE_i),lBill_THFTYPE_i) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CSR135^1 : TPTP v8.2.0. Released v4.1.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 00:37:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.35 % (13495)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.37 % (13496)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.37 % (13499)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.20/0.37 % (13501)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.37 % (13498)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.20/0.37 % (13500)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.37 % (13502)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.20/0.37 % (13499)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.37 % (13498)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: % (13497)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.37 Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % Exception at run slice level
% 0.20/0.37 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.37 % (13500)First to succeed.
% 0.20/0.37 % (13501)Also succeeded, but the first one will report.
% 0.20/0.37 % (13498)Also succeeded, but the first one will report.
% 0.20/0.37 % (13500)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13495"
% 0.20/0.37 % (13500)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.37 % (13500)------------------------------
% 0.20/0.37 % (13500)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.37 % (13500)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (13500)Memory used [KB]: 759
% 0.20/0.37 % (13500)Time elapsed: 0.005 s
% 0.20/0.37 % (13500)Instructions burned: 5 (million)
% 0.20/0.37 % (13495)Success in time 0.007 s
%------------------------------------------------------------------------------