TSTP Solution File: SYO108^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO108^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 : n026.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.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO108^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n026.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.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 09:51:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 % (25340)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36 % (25342)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.36 % Exception at run slice level
% 0.13/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.36 % (25347)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.36 % (25344)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.36 % (25345)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.20/0.36 % (25341)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.20/0.36 % (25346)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.20/0.36 % (25343)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.36 % (25344)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.36 % (25343)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.20/0.36 % Exception at run slice level
% 0.20/0.36 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.36 % Exception at run slice level% Exception at run slice level
% 0.20/0.36
% 0.20/0.36 User error: User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructsFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.36
% 0.20/0.36 % (25346)First to succeed.
% 0.20/0.36 % (25345)Also succeeded, but the first one will report.
% 0.20/0.36 % (25343)Also succeeded, but the first one will report.
% 0.20/0.37 % (25346)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-25340"
% 0.20/0.37 % (25346)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.37 thf(func_def_0, type, cG: $i > $o).
% 0.20/0.37 thf(func_def_1, type, cN: $i > $o).
% 0.20/0.37 thf(func_def_2, type, cM: $i > $o).
% 0.20/0.37 thf(func_def_10, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.20/0.37 thf(func_def_11, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.20/0.37 thf(func_def_12, type, vAND: $o > $o > $o).
% 0.20/0.37 thf(func_def_13, type, vOR: $o > $o > $o).
% 0.20/0.37 thf(func_def_14, type, vIMP: $o > $o > $o).
% 0.20/0.37 thf(func_def_15, type, vNOT: $o > $o).
% 0.20/0.37 thf(func_def_16, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.20/0.37 thf(f72,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(avatar_sat_refutation,[],[f24,f32,f64,f69,f71])).
% 0.20/0.37 thf(f71,plain,(
% 0.20/0.37 ~spl3_1 | ~spl3_4),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f70])).
% 0.20/0.37 thf(f70,plain,(
% 0.20/0.37 $false | (~spl3_1 | ~spl3_4)),
% 0.20/0.37 inference(subsumption_resolution,[],[f31,f19])).
% 0.20/0.37 thf(f19,plain,(
% 0.20/0.37 ( ! [X0 : $i] : (($true != vAPP($i,$o,cN,X0))) ) | ~spl3_1),
% 0.20/0.37 inference(avatar_component_clause,[],[f18])).
% 0.20/0.37 thf(f18,plain,(
% 0.20/0.37 spl3_1 <=> ! [X0] : ($true != vAPP($i,$o,cN,X0))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.20/0.37 thf(f31,plain,(
% 0.20/0.37 ($true = vAPP($i,$o,cN,sK1)) | ~spl3_4),
% 0.20/0.37 inference(avatar_component_clause,[],[f29])).
% 0.20/0.37 thf(f29,plain,(
% 0.20/0.37 spl3_4 <=> ($true = vAPP($i,$o,cN,sK1))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.20/0.37 thf(f69,plain,(
% 0.20/0.37 ~spl3_3),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f68])).
% 0.20/0.37 thf(f68,plain,(
% 0.20/0.37 $false | ~spl3_3),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f67])).
% 0.20/0.37 thf(f67,plain,(
% 0.20/0.37 ($true != $true) | ~spl3_3),
% 0.20/0.37 inference(superposition,[],[f13,f27])).
% 0.20/0.37 thf(f27,plain,(
% 0.20/0.37 ( ! [X2 : $i] : ((vAPP($i,$o,cM,X2) = $true)) ) | ~spl3_3),
% 0.20/0.37 inference(avatar_component_clause,[],[f26])).
% 0.20/0.37 thf(f26,plain,(
% 0.20/0.37 spl3_3 <=> ! [X2] : (vAPP($i,$o,cM,X2) = $true)),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 ($true != vAPP($i,$o,cM,sK2))),
% 0.20/0.37 inference(cnf_transformation,[],[f12])).
% 0.20/0.37 thf(f12,plain,(
% 0.20/0.37 ! [X0] : (($true != vAPP($i,$o,cG,sK0)) | ($true != vAPP($i,$o,cN,X0))) & ! [X2] : (($true = vAPP($i,$o,cN,sK1)) | (vAPP($i,$o,cM,X2) = $true)) & ! [X4] : ($true = vAPP($i,$o,cG,X4)) & ($true != vAPP($i,$o,cM,sK2))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ? [X1] : (vAPP($i,$o,cG,X1) != $true) => ($true != vAPP($i,$o,cG,sK0))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ? [X3] : (vAPP($i,$o,cN,X3) = $true) => ($true = vAPP($i,$o,cN,sK1))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ? [X5] : ($true != vAPP($i,$o,cM,X5)) => ($true != vAPP($i,$o,cM,sK2))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 ! [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))),
% 0.20/0.37 inference(ennf_transformation,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 ~(~! [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)))),
% 0.20/0.37 inference(flattening,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 ~(~! [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)))),
% 0.20/0.37 inference(fool_elimination,[],[f5])).
% 0.20/0.37 thf(f5,plain,(
% 0.20/0.37 ~(~! [X0] : (~! [X1] : vAPP($i,$o,cG,X1) | ~vAPP($i,$o,cN,X0)) | ~! [X2] : (? [X3] : vAPP($i,$o,cN,X3) | vAPP($i,$o,cM,X2)) | ? [X4] : ~vAPP($i,$o,cG,X4) | ! [X5] : vAPP($i,$o,cM,X5))),
% 0.20/0.37 inference(rectify,[],[f2])).
% 0.20/0.37 thf(f2,negated_conjecture,(
% 0.20/0.37 ~(~! [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.37 inference(negated_conjecture,[],[f1])).
% 0.20/0.37 thf(f1,conjecture,(
% 0.20/0.37 ~! [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.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM79)).
% 0.20/0.37 thf(f64,plain,(
% 0.20/0.37 spl3_2),
% 0.20/0.37 inference(avatar_contradiction_clause,[],[f63])).
% 0.20/0.37 thf(f63,plain,(
% 0.20/0.37 $false | spl3_2),
% 0.20/0.37 inference(subsumption_resolution,[],[f23,f14])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 ( ! [X4 : $i] : (($true = vAPP($i,$o,cG,X4))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f12])).
% 0.20/0.37 thf(f23,plain,(
% 0.20/0.37 ($true != vAPP($i,$o,cG,sK0)) | spl3_2),
% 0.20/0.37 inference(avatar_component_clause,[],[f21])).
% 0.20/0.37 thf(f21,plain,(
% 0.20/0.37 spl3_2 <=> ($true = vAPP($i,$o,cG,sK0))),
% 0.20/0.37 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.20/0.37 thf(f32,plain,(
% 0.20/0.37 spl3_3 | spl3_4),
% 0.20/0.37 inference(avatar_split_clause,[],[f15,f29,f26])).
% 0.20/0.37 thf(f15,plain,(
% 0.20/0.37 ( ! [X2 : $i] : (($true = vAPP($i,$o,cN,sK1)) | (vAPP($i,$o,cM,X2) = $true)) )),
% 0.20/0.37 inference(cnf_transformation,[],[f12])).
% 0.20/0.37 thf(f24,plain,(
% 0.20/0.37 spl3_1 | ~spl3_2),
% 0.20/0.37 inference(avatar_split_clause,[],[f16,f21,f18])).
% 0.20/0.37 thf(f16,plain,(
% 0.20/0.37 ( ! [X0 : $i] : (($true != vAPP($i,$o,cG,sK0)) | ($true != vAPP($i,$o,cN,X0))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f12])).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (25346)------------------------------
% 0.20/0.37 % (25346)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.20/0.37 % (25346)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (25346)Memory used [KB]: 768
% 0.20/0.37 % (25346)Time elapsed: 0.005 s
% 0.20/0.37 % (25346)Instructions burned: 5 (million)
% 0.20/0.37 % (25340)Success in time 0.019 s
%------------------------------------------------------------------------------