TSTP Solution File: SYO111^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO111^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 : n017.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:20 EDT 2024
% Result : Theorem 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO111^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 08:46:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.35 % (26286)Running in auto input_syntax mode. Trying TPTP
% 0.20/0.38 % (26287)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.38 % (26293)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.38 % (26288)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % Exception at run slice level
% 0.20/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.38 % (26289)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.39 % (26291)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.39 % (26289)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.39 % (26290)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.39 % (26290)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.39 % Exception at run slice level
% 0.20/0.39 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.39 % (26291)First to succeed.
% 0.20/0.39 % (26289)Also succeeded, but the first one will report.
% 0.20/0.39 % (26292)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.39 % (26291)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-26286"
% 0.20/0.39 % (26291)Refutation found. Thanks to Tanya!
% 0.20/0.39 % SZS status Theorem for theBenchmark
% 0.20/0.39 % SZS output start Proof for theBenchmark
% 0.20/0.39 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.39 thf(func_def_0, type, cG: $i > $o).
% 0.20/0.39 thf(func_def_1, type, cN: $i > $o).
% 0.20/0.39 thf(func_def_2, type, cM: $i > $o).
% 0.20/0.39 thf(func_def_6, type, sP0: $o).
% 0.20/0.39 thf(func_def_13, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.20/0.39 thf(func_def_14, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.20/0.39 thf(func_def_15, type, vAND: $o > $o > $o).
% 0.20/0.39 thf(func_def_16, type, vOR: $o > $o > $o).
% 0.20/0.39 thf(func_def_17, type, vIMP: $o > $o > $o).
% 0.20/0.39 thf(func_def_18, type, vNOT: $o > $o).
% 0.20/0.39 thf(func_def_19, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.39 thf(f72,plain,(
% 0.20/0.39 $false),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f69])).
% 0.20/0.39 thf(f69,plain,(
% 0.20/0.39 ($true != $true)),
% 0.20/0.39 inference(superposition,[],[f68,f66])).
% 0.20/0.39 thf(f66,plain,(
% 0.20/0.39 ($true = vAPP($i,$o,cN,sK3))),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f65])).
% 0.20/0.39 thf(f65,plain,(
% 0.20/0.39 ($true = $false) | ($true = vAPP($i,$o,cN,sK3))),
% 0.20/0.39 inference(superposition,[],[f42,f29])).
% 0.20/0.39 thf(f29,plain,(
% 0.20/0.39 ( ! [X2 : $i] : ((vAPP($i,$o,cM,X2) = $true) | ($true = vAPP($i,$o,cN,sK3))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f22])).
% 0.20/0.39 thf(f22,plain,(
% 0.20/0.39 ! [X0] : (($true != vAPP($i,$o,cG,sK2)) | ($true != vAPP($i,$o,cN,X0))) & ! [X2] : (($true = vAPP($i,$o,cN,sK3)) | (vAPP($i,$o,cM,X2) = $true)) & ! [X4] : ($true = vAPP($i,$o,cG,X4)) & ($true != vAPP($i,$o,cM,sK4)) & ((! [X6] : ($true = vAPP($i,$o,cG,X6)) & ($true = vAPP($i,$o,cN,sK5))) | ($true = sP0) | ($true != vAPP($i,$o,cG,sK6)) | ! [X9] : ($true = vAPP($i,$o,cM,X9)))),
% 0.20/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f16,f21,f20,f19,f18,f17])).
% 0.20/0.39 thf(f17,plain,(
% 0.20/0.39 ? [X1] : (vAPP($i,$o,cG,X1) != $true) => ($true != vAPP($i,$o,cG,sK2))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f18,plain,(
% 0.20/0.39 ? [X3] : (vAPP($i,$o,cN,X3) = $true) => ($true = vAPP($i,$o,cN,sK3))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f19,plain,(
% 0.20/0.39 ? [X5] : ($true != vAPP($i,$o,cM,X5)) => ($true != vAPP($i,$o,cM,sK4))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f20,plain,(
% 0.20/0.39 ? [X7] : ($true = vAPP($i,$o,cN,X7)) => ($true = vAPP($i,$o,cN,sK5))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f21,plain,(
% 0.20/0.39 ? [X8] : ($true != vAPP($i,$o,cG,X8)) => ($true != vAPP($i,$o,cG,sK6))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f16,plain,(
% 0.20/0.39 ! [X0] : (? [X1] : (vAPP($i,$o,cG,X1) != $true) | ($true != vAPP($i,$o,cN,X0))) & ! [X2] : (? [X3] : (vAPP($i,$o,cN,X3) = $true) | (vAPP($i,$o,cM,X2) = $true)) & ! [X4] : ($true = vAPP($i,$o,cG,X4)) & ? [X5] : ($true != vAPP($i,$o,cM,X5)) & ((! [X6] : ($true = vAPP($i,$o,cG,X6)) & ? [X7] : ($true = vAPP($i,$o,cN,X7))) | ($true = sP0) | ? [X8] : ($true != vAPP($i,$o,cG,X8)) | ! [X9] : ($true = vAPP($i,$o,cM,X9)))),
% 0.20/0.39 inference(rectify,[],[f11])).
% 0.20/0.39 thf(f11,plain,(
% 0.20/0.39 ! [X6] : (? [X7] : ($true != vAPP($i,$o,cG,X7)) | ($true != vAPP($i,$o,cN,X6))) & ! [X8] : (? [X9] : ($true = vAPP($i,$o,cN,X9)) | ($true = vAPP($i,$o,cM,X8))) & ! [X10] : ($true = vAPP($i,$o,cG,X10)) & ? [X11] : ($true != vAPP($i,$o,cM,X11)) & ((! [X0] : ($true = vAPP($i,$o,cG,X0)) & ? [X1] : ($true = vAPP($i,$o,cN,X1))) | ($true = sP0) | ? [X4] : ($true != vAPP($i,$o,cG,X4)) | ! [X5] : ($true = vAPP($i,$o,cM,X5)))),
% 0.20/0.39 inference(definition_folding,[],[f9,f10])).
% 0.20/0.39 thf(f10,plain,(
% 0.20/0.39 (! [X2] : ($true != vAPP($i,$o,cN,X2)) & ? [X3] : ($true != vAPP($i,$o,cM,X3))) | ~($true = sP0)),
% 0.20/0.39 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.20/0.39 thf(f9,plain,(
% 0.20/0.39 ! [X6] : (? [X7] : ($true != vAPP($i,$o,cG,X7)) | ($true != vAPP($i,$o,cN,X6))) & ! [X8] : (? [X9] : ($true = vAPP($i,$o,cN,X9)) | ($true = vAPP($i,$o,cM,X8))) & ! [X10] : ($true = vAPP($i,$o,cG,X10)) & ? [X11] : ($true != vAPP($i,$o,cM,X11)) & ((! [X0] : ($true = vAPP($i,$o,cG,X0)) & ? [X1] : ($true = vAPP($i,$o,cN,X1))) | (! [X2] : ($true != vAPP($i,$o,cN,X2)) & ? [X3] : ($true != vAPP($i,$o,cM,X3))) | ? [X4] : ($true != vAPP($i,$o,cG,X4)) | ! [X5] : ($true = vAPP($i,$o,cM,X5)))),
% 0.20/0.39 inference(flattening,[],[f8])).
% 0.20/0.39 thf(f8,plain,(
% 0.20/0.39 (! [X6] : (? [X7] : ($true != vAPP($i,$o,cG,X7)) | ($true != vAPP($i,$o,cN,X6))) & ! [X8] : (? [X9] : ($true = vAPP($i,$o,cN,X9)) | ($true = vAPP($i,$o,cM,X8))) & ! [X10] : ($true = vAPP($i,$o,cG,X10)) & ? [X11] : ($true != vAPP($i,$o,cM,X11))) & ((! [X0] : ($true = vAPP($i,$o,cG,X0)) & ? [X1] : ($true = vAPP($i,$o,cN,X1))) | (! [X2] : ($true != vAPP($i,$o,cN,X2)) & ? [X3] : ($true != vAPP($i,$o,cM,X3))) | ? [X4] : ($true != vAPP($i,$o,cG,X4)) | ! [X5] : ($true = vAPP($i,$o,cM,X5)))),
% 0.20/0.39 inference(ennf_transformation,[],[f7])).
% 0.20/0.39 thf(f7,plain,(
% 0.20/0.39 ~((~(~! [X0] : ($true = vAPP($i,$o,cG,X0)) | ! [X1] : ($true != vAPP($i,$o,cN,X1))) | ~(? [X2] : ($true = vAPP($i,$o,cN,X2)) | ! [X3] : ($true = vAPP($i,$o,cM,X3))) | ? [X4] : ($true != vAPP($i,$o,cG,X4)) | ! [X5] : ($true = vAPP($i,$o,cM,X5))) => (~! [X6] : (~! [X7] : ($true = vAPP($i,$o,cG,X7)) | ($true != vAPP($i,$o,cN,X6))) | ~! [X8] : (? [X9] : ($true = vAPP($i,$o,cN,X9)) | ($true = vAPP($i,$o,cM,X8))) | ? [X10] : ($true != vAPP($i,$o,cG,X10)) | ! [X11] : ($true = vAPP($i,$o,cM,X11))))),
% 0.20/0.39 inference(flattening,[],[f6])).
% 0.20/0.39 thf(f6,plain,(
% 0.20/0.39 ~((~(~! [X0] : ($true = vAPP($i,$o,cG,X0)) | ! [X1] : ~($true = vAPP($i,$o,cN,X1))) | ~(? [X2] : ($true = vAPP($i,$o,cN,X2)) | ! [X3] : ($true = vAPP($i,$o,cM,X3))) | ? [X4] : ~($true = vAPP($i,$o,cG,X4)) | ! [X5] : ($true = vAPP($i,$o,cM,X5))) => (~! [X6] : (~! [X7] : ($true = vAPP($i,$o,cG,X7)) | ~($true = vAPP($i,$o,cN,X6))) | ~! [X8] : (? [X9] : ($true = vAPP($i,$o,cN,X9)) | ($true = vAPP($i,$o,cM,X8))) | ? [X10] : ~($true = vAPP($i,$o,cG,X10)) | ! [X11] : ($true = vAPP($i,$o,cM,X11))))),
% 0.20/0.39 inference(fool_elimination,[],[f5])).
% 0.20/0.39 thf(f5,plain,(
% 0.20/0.39 ~((~(~! [X0] : vAPP($i,$o,cG,X0) | ! [X1] : ~vAPP($i,$o,cN,X1)) | ~(? [X2] : vAPP($i,$o,cN,X2) | ! [X3] : vAPP($i,$o,cM,X3)) | ? [X4] : ~vAPP($i,$o,cG,X4) | ! [X5] : vAPP($i,$o,cM,X5)) => (~! [X6] : (~! [X7] : vAPP($i,$o,cG,X7) | ~vAPP($i,$o,cN,X6)) | ~! [X8] : (? [X9] : vAPP($i,$o,cN,X9) | vAPP($i,$o,cM,X8)) | ? [X10] : ~vAPP($i,$o,cG,X10) | ! [X11] : vAPP($i,$o,cM,X11)))),
% 0.20/0.39 inference(rectify,[],[f2])).
% 0.20/0.39 thf(f2,negated_conjecture,(
% 0.20/0.39 ~((~(~! [X5] : vAPP($i,$o,cG,X5) | ! [X4] : ~vAPP($i,$o,cN,X4)) | ~(? [X3] : vAPP($i,$o,cN,X3) | ! [X2] : vAPP($i,$o,cM,X2)) | ? [X1] : ~vAPP($i,$o,cG,X1) | ! [X0] : vAPP($i,$o,cM,X0)) => (~! [X4] : (~! [X5] : vAPP($i,$o,cG,X5) | ~vAPP($i,$o,cN,X4)) | ~! [X2] : (? [X3] : vAPP($i,$o,cN,X3) | vAPP($i,$o,cM,X2)) | ? [X1] : ~vAPP($i,$o,cG,X1) | ! [X0] : vAPP($i,$o,cM,X0)))),
% 0.20/0.39 inference(negated_conjecture,[],[f1])).
% 0.20/0.39 thf(f1,conjecture,(
% 0.20/0.39 (~(~! [X5] : vAPP($i,$o,cG,X5) | ! [X4] : ~vAPP($i,$o,cN,X4)) | ~(? [X3] : vAPP($i,$o,cN,X3) | ! [X2] : vAPP($i,$o,cM,X2)) | ? [X1] : ~vAPP($i,$o,cG,X1) | ! [X0] : vAPP($i,$o,cM,X0)) => (~! [X4] : (~! [X5] : vAPP($i,$o,cG,X5) | ~vAPP($i,$o,cN,X4)) | ~! [X2] : (? [X3] : vAPP($i,$o,cN,X3) | vAPP($i,$o,cM,X2)) | ? [X1] : ~vAPP($i,$o,cG,X1) | ! [X0] : vAPP($i,$o,cM,X0))),
% 0.20/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM80)).
% 0.20/0.39 thf(f42,plain,(
% 0.20/0.39 ($false = vAPP($i,$o,cM,sK4))),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f40])).
% 0.20/0.39 thf(f40,plain,(
% 0.20/0.39 ($true != $true) | ($false = vAPP($i,$o,cM,sK4))),
% 0.20/0.39 inference(superposition,[],[f27,f4])).
% 0.20/0.39 thf(f4,plain,(
% 0.20/0.39 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.20/0.39 introduced(fool_axiom,[])).
% 0.20/0.39 thf(f27,plain,(
% 0.20/0.39 ($true != vAPP($i,$o,cM,sK4))),
% 0.20/0.39 inference(cnf_transformation,[],[f22])).
% 0.20/0.39 thf(f68,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (($true != vAPP($i,$o,cN,X0))) )),
% 0.20/0.39 inference(subsumption_resolution,[],[f30,f28])).
% 0.20/0.39 thf(f28,plain,(
% 0.20/0.39 ( ! [X4 : $i] : (($true = vAPP($i,$o,cG,X4))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f22])).
% 0.20/0.39 thf(f30,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (($true != vAPP($i,$o,cG,sK2)) | ($true != vAPP($i,$o,cN,X0))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f22])).
% 0.20/0.39 % SZS output end Proof for theBenchmark
% 0.20/0.39 % (26291)------------------------------
% 0.20/0.39 % (26291)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.39 % (26291)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (26291)Memory used [KB]: 768
% 0.20/0.39 % (26291)Time elapsed: 0.029 s
% 0.20/0.39 % (26291)Instructions burned: 6 (million)
% 0.20/0.39 % (26286)Success in time 0.034 s
%------------------------------------------------------------------------------