TSTP Solution File: SYO261^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO261^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 09:10:46 EDT 2024
% Result : Theorem 0.23s 0.41s
% Output : Refutation 0.23s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SYO261^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 10:25:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 % (15047)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.40 % (15054)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.23/0.40 % (15048)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.23/0.40 % Exception at run slice level
% 0.23/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.40 % Exception at run slice level
% 0.23/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.40 % (15050)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.23/0.40 % (15050)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.40 % (15049)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.23/0.40 % (15052)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.23/0.40 % (15051)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.23/0.40 % Exception at run slice level
% 0.23/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.23/0.40 % (15051)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.23/0.40 % Exception at run slice level
% 0.23/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs% (15053)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.23/0.40
% 0.23/0.41 % (15050)First to succeed.
% 0.23/0.41 % (15050)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15047"
% 0.23/0.41 % (15050)Refutation found. Thanks to Tanya!
% 0.23/0.41 % SZS status Theorem for theBenchmark
% 0.23/0.41 % SZS output start Proof for theBenchmark
% 0.23/0.41 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.23/0.41 thf(func_def_1, type, cP: $i > $o).
% 0.23/0.41 thf(func_def_2, type, c1_plus: $i > $i).
% 0.23/0.41 thf(func_def_7, type, sK0: ($i > $o) > $i).
% 0.23/0.41 thf(func_def_9, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.23/0.41 thf(func_def_10, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.23/0.41 thf(func_def_11, type, vAND: $o > $o > $o).
% 0.23/0.41 thf(func_def_12, type, vOR: $o > $o > $o).
% 0.23/0.41 thf(func_def_13, type, vIMP: $o > $o > $o).
% 0.23/0.41 thf(func_def_14, type, vNOT: $o > $o).
% 0.23/0.41 thf(func_def_15, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.23/0.41 thf(f104,plain,(
% 0.23/0.41 $false),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f101])).
% 0.23/0.41 thf(f101,plain,(
% 0.23/0.41 ($true != $true)),
% 0.23/0.41 inference(superposition,[],[f100,f13])).
% 0.23/0.41 thf(f13,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,cO) = $true)),
% 0.23/0.41 inference(cnf_transformation,[],[f10])).
% 0.23/0.41 thf(f10,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) != $true) & ! [X0] : (($true = vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0))) | ($true != vAPP($i,$o,cP,X0))) & (vAPP($i,$o,cP,cO) = $true) & ! [X1 : $i > $o] : (($true = vAPP($i,$o,X1,n)) | (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,vAPP(sTfun($i,$o),$i,sK0,X1)))) & ($true = vAPP($i,$o,X1,vAPP(sTfun($i,$o),$i,sK0,X1)))) | ($true != vAPP($i,$o,X1,cO)))),
% 0.23/0.41 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.23/0.41 thf(f9,plain,(
% 0.23/0.41 ! [X1 : $i > $o] : (? [X2] : (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,X2))) & ($true = vAPP($i,$o,X1,X2))) => (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,vAPP(sTfun($i,$o),$i,sK0,X1)))) & ($true = vAPP($i,$o,X1,vAPP(sTfun($i,$o),$i,sK0,X1)))))),
% 0.23/0.41 introduced(choice_axiom,[])).
% 0.23/0.41 thf(f8,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) != $true) & ! [X0] : (($true = vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0))) | ($true != vAPP($i,$o,cP,X0))) & (vAPP($i,$o,cP,cO) = $true) & ! [X1 : $i > $o] : (($true = vAPP($i,$o,X1,n)) | ? [X2] : (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,X2))) & ($true = vAPP($i,$o,X1,X2))) | ($true != vAPP($i,$o,X1,cO)))),
% 0.23/0.41 inference(flattening,[],[f7])).
% 0.23/0.41 thf(f7,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) != $true) & (! [X0] : (($true = vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0))) | ($true != vAPP($i,$o,cP,X0))) & (vAPP($i,$o,cP,cO) = $true) & ! [X1 : $i > $o] : (($true = vAPP($i,$o,X1,n)) | (? [X2] : (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,X2))) & ($true = vAPP($i,$o,X1,X2))) | ($true != vAPP($i,$o,X1,cO)))))),
% 0.23/0.41 inference(ennf_transformation,[],[f6])).
% 0.23/0.41 thf(f6,plain,(
% 0.23/0.41 ~((! [X0] : (($true = vAPP($i,$o,cP,X0)) => ($true = vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0)))) & (vAPP($i,$o,cP,cO) = $true) & ! [X1 : $i > $o] : ((! [X2] : (($true = vAPP($i,$o,X1,X2)) => ($true = vAPP($i,$o,X1,vAPP($i,$i,c1_plus,X2)))) & ($true = vAPP($i,$o,X1,cO))) => ($true = vAPP($i,$o,X1,n)))) => (vAPP($i,$o,cP,n) = $true))),
% 0.23/0.41 inference(fool_elimination,[],[f5])).
% 0.23/0.41 thf(f5,plain,(
% 0.23/0.41 ~((! [X0] : (vAPP($i,$o,cP,X0) => vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0))) & vAPP($i,$o,cP,cO) & ! [X1 : $i > $o] : ((! [X2] : (vAPP($i,$o,X1,X2) => vAPP($i,$o,X1,vAPP($i,$i,c1_plus,X2))) & vAPP($i,$o,X1,cO)) => vAPP($i,$o,X1,n))) => vAPP($i,$o,cP,n))),
% 0.23/0.41 inference(rectify,[],[f2])).
% 0.23/0.41 thf(f2,negated_conjecture,(
% 0.23/0.41 ~((! [X1] : (vAPP($i,$o,cP,X1) => vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X1))) & vAPP($i,$o,cP,cO) & ! [X0 : $i > $o] : ((! [X1] : (vAPP($i,$o,X0,X1) => vAPP($i,$o,X0,vAPP($i,$i,c1_plus,X1))) & vAPP($i,$o,X0,cO)) => vAPP($i,$o,X0,n))) => vAPP($i,$o,cP,n))),
% 0.23/0.41 inference(negated_conjecture,[],[f1])).
% 0.23/0.41 thf(f1,conjecture,(
% 0.23/0.41 (! [X1] : (vAPP($i,$o,cP,X1) => vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X1))) & vAPP($i,$o,cP,cO) & ! [X0 : $i > $o] : ((! [X1] : (vAPP($i,$o,X0,X1) => vAPP($i,$o,X0,vAPP($i,$i,c1_plus,X1))) & vAPP($i,$o,X0,cO)) => vAPP($i,$o,X0,n))) => vAPP($i,$o,cP,n)),
% 0.23/0.41 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_I1)).
% 0.23/0.41 thf(f100,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,cO) != $true)),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f99])).
% 0.23/0.41 thf(f99,plain,(
% 0.23/0.41 ($true = $false) | (vAPP($i,$o,cP,cO) != $true)),
% 0.23/0.41 inference(forward_demodulation,[],[f94,f27])).
% 0.23/0.41 thf(f27,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) = $false)),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f25])).
% 0.23/0.41 thf(f25,plain,(
% 0.23/0.41 ($true != $true) | (vAPP($i,$o,cP,n) = $false)),
% 0.23/0.41 inference(superposition,[],[f15,f4])).
% 0.23/0.41 thf(f4,plain,(
% 0.23/0.41 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.23/0.41 introduced(fool_axiom,[])).
% 0.23/0.41 thf(f15,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) != $true)),
% 0.23/0.41 inference(cnf_transformation,[],[f10])).
% 0.23/0.41 thf(f94,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) = $true) | (vAPP($i,$o,cP,cO) != $true)),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f93])).
% 0.23/0.41 thf(f93,plain,(
% 0.23/0.41 ($true != $true) | (vAPP($i,$o,cP,n) = $true) | (vAPP($i,$o,cP,cO) != $true)),
% 0.23/0.41 inference(superposition,[],[f80,f11])).
% 0.23/0.41 thf(f11,plain,(
% 0.23/0.41 ( ! [X1 : $i > $o] : (($true = vAPP($i,$o,X1,vAPP(sTfun($i,$o),$i,sK0,X1))) | ($true = vAPP($i,$o,X1,n)) | ($true != vAPP($i,$o,X1,cO))) )),
% 0.23/0.41 inference(cnf_transformation,[],[f10])).
% 0.23/0.41 thf(f80,plain,(
% 0.23/0.41 ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f79])).
% 0.23/0.41 thf(f79,plain,(
% 0.23/0.41 ($true != $true) | ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(forward_demodulation,[],[f78,f13])).
% 0.23/0.41 thf(f78,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,cO) != $true) | ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f77])).
% 0.23/0.41 thf(f77,plain,(
% 0.23/0.41 ($true = $false) | (vAPP($i,$o,cP,cO) != $true) | ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(forward_demodulation,[],[f73,f27])).
% 0.23/0.41 thf(f73,plain,(
% 0.23/0.41 (vAPP($i,$o,cP,n) = $true) | (vAPP($i,$o,cP,cO) != $true) | ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(trivial_inequality_removal,[],[f70])).
% 0.23/0.41 thf(f70,plain,(
% 0.23/0.41 ($true != $true) | (vAPP($i,$o,cP,n) = $true) | (vAPP($i,$o,cP,cO) != $true) | ($true != vAPP($i,$o,cP,vAPP(sTfun($i,$o),$i,sK0,cP)))),
% 0.23/0.41 inference(superposition,[],[f12,f14])).
% 0.23/0.41 thf(f14,plain,(
% 0.23/0.41 ( ! [X0 : $i] : (($true = vAPP($i,$o,cP,vAPP($i,$i,c1_plus,X0))) | ($true != vAPP($i,$o,cP,X0))) )),
% 0.23/0.41 inference(cnf_transformation,[],[f10])).
% 0.23/0.41 thf(f12,plain,(
% 0.23/0.41 ( ! [X1 : $i > $o] : (($true != vAPP($i,$o,X1,vAPP($i,$i,c1_plus,vAPP(sTfun($i,$o),$i,sK0,X1)))) | ($true = vAPP($i,$o,X1,n)) | ($true != vAPP($i,$o,X1,cO))) )),
% 0.23/0.41 inference(cnf_transformation,[],[f10])).
% 0.23/0.41 % SZS output end Proof for theBenchmark
% 0.23/0.41 % (15050)------------------------------
% 0.23/0.41 % (15050)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.23/0.41 % (15050)Termination reason: Refutation
% 0.23/0.41
% 0.23/0.41 % (15050)Memory used [KB]: 782
% 0.23/0.41 % (15050)Time elapsed: 0.007 s
% 0.23/0.41 % (15050)Instructions burned: 8 (million)
% 0.23/0.41 % (15047)Success in time 0.034 s
%------------------------------------------------------------------------------