TSTP Solution File: SYO256^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO256^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 : n027.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:45 EDT 2024
% Result : Theorem 0.16s 0.33s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SYO256^5 : TPTP v8.2.0. Released v4.0.0.
% 0.05/0.10 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n027.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon May 20 10:23:53 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 % (27908)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.32 % (27911)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.16/0.32 % (27911)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.33 % (27910)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.33 % Exception at run slice level
% 0.16/0.33 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.33 % (27915)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.16/0.33 % (27911)First to succeed.
% 0.16/0.33 % Exception at run slice level
% 0.16/0.33 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.33 % (27911)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-27908"
% 0.16/0.33 % (27911)Refutation found. Thanks to Tanya!
% 0.16/0.33 % SZS status Theorem for theBenchmark
% 0.16/0.33 % SZS output start Proof for theBenchmark
% 0.16/0.33 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.16/0.33 thf(type_def_6, type, a: $tType).
% 0.16/0.33 thf(func_def_0, type, a: $tType).
% 0.16/0.33 thf(func_def_4, type, vOR: $o > $o > $o).
% 0.16/0.33 thf(func_def_5, type, vPI: !>[X0: $tType]:((X0 > $o) > $o)).
% 0.16/0.33 thf(func_def_6, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.16/0.33 thf(func_def_7, type, sCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.16/0.33 thf(func_def_8, type, sK0: $o > $o).
% 0.16/0.33 thf(func_def_9, type, sK1: a > $o).
% 0.16/0.33 thf(func_def_10, type, sK2: a > $o).
% 0.16/0.33 thf(func_def_12, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.16/0.33 thf(func_def_13, type, vAND: $o > $o > $o).
% 0.16/0.33 thf(func_def_14, type, vIMP: $o > $o > $o).
% 0.16/0.33 thf(func_def_15, type, vNOT: $o > $o).
% 0.16/0.33 thf(func_def_16, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.16/0.33 thf(func_def_17, type, sK4: a).
% 0.16/0.33 thf(func_def_18, type, sK5: a).
% 0.16/0.33 thf(func_def_19, type, sK6: a).
% 0.16/0.33 thf(f86,plain,(
% 0.16/0.33 $false),
% 0.16/0.33 inference(avatar_sat_refutation,[],[f48,f56,f65,f73,f76,f85])).
% 0.16/0.33 thf(f85,plain,(
% 0.16/0.33 ~spl3_1 | ~spl3_3),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f84])).
% 0.16/0.33 thf(f84,plain,(
% 0.16/0.33 $false | (~spl3_1 | ~spl3_3)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f79])).
% 0.16/0.33 thf(f79,plain,(
% 0.16/0.33 ($true = $false) | (~spl3_1 | ~spl3_3)),
% 0.16/0.33 inference(backward_demodulation,[],[f44,f52])).
% 0.16/0.33 thf(f52,plain,(
% 0.16/0.33 ($false = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2)))) | ~spl3_3),
% 0.16/0.33 inference(avatar_component_clause,[],[f50])).
% 0.16/0.33 thf(f50,plain,(
% 0.16/0.33 spl3_3 <=> ($false = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl3_3])])).
% 0.16/0.33 thf(f44,plain,(
% 0.16/0.33 ($true = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2)))) | ~spl3_1),
% 0.16/0.33 inference(avatar_component_clause,[],[f42])).
% 0.16/0.33 thf(f42,plain,(
% 0.16/0.33 spl3_1 <=> ($true = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl3_1])])).
% 0.16/0.33 thf(f76,plain,(
% 0.16/0.33 ~spl3_1 | ~spl3_4),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f75])).
% 0.16/0.33 thf(f75,plain,(
% 0.16/0.33 $false | (~spl3_1 | ~spl3_4)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f74])).
% 0.16/0.33 thf(f74,plain,(
% 0.16/0.33 ($true = $false) | (~spl3_1 | ~spl3_4)),
% 0.16/0.33 inference(forward_demodulation,[],[f44,f55])).
% 0.16/0.33 thf(f55,plain,(
% 0.16/0.33 ( ! [X3 : $o] : (($false = vAPP($o,$o,sK0,X3))) ) | ~spl3_4),
% 0.16/0.33 inference(avatar_component_clause,[],[f54])).
% 0.16/0.33 thf(f54,plain,(
% 0.16/0.33 spl3_4 <=> ! [X3 : $o] : ($false = vAPP($o,$o,sK0,X3))),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl3_4])])).
% 0.16/0.33 thf(f73,plain,(
% 0.16/0.33 ~spl3_2 | ~spl3_4),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f72])).
% 0.16/0.33 thf(f72,plain,(
% 0.16/0.33 $false | (~spl3_2 | ~spl3_4)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f69])).
% 0.16/0.33 thf(f69,plain,(
% 0.16/0.33 ($true = $false) | (~spl3_2 | ~spl3_4)),
% 0.16/0.33 inference(backward_demodulation,[],[f47,f55])).
% 0.16/0.33 thf(f47,plain,(
% 0.16/0.33 ( ! [X3 : $o] : (($true = vAPP($o,$o,sK0,X3))) ) | ~spl3_2),
% 0.16/0.33 inference(avatar_component_clause,[],[f46])).
% 0.16/0.33 thf(f46,plain,(
% 0.16/0.33 spl3_2 <=> ! [X3 : $o] : ($true = vAPP($o,$o,sK0,X3))),
% 0.16/0.33 introduced(avatar_definition,[new_symbols(naming,[spl3_2])])).
% 0.16/0.33 thf(f65,plain,(
% 0.16/0.33 ~spl3_2 | ~spl3_3),
% 0.16/0.33 inference(avatar_contradiction_clause,[],[f64])).
% 0.16/0.33 thf(f64,plain,(
% 0.16/0.33 $false | (~spl3_2 | ~spl3_3)),
% 0.16/0.33 inference(trivial_inequality_removal,[],[f58])).
% 0.16/0.33 thf(f58,plain,(
% 0.16/0.33 ($true = $false) | (~spl3_2 | ~spl3_3)),
% 0.16/0.33 inference(superposition,[],[f52,f47])).
% 0.16/0.33 thf(f56,plain,(
% 0.16/0.33 spl3_3 | spl3_4),
% 0.16/0.33 inference(avatar_split_clause,[],[f12,f54,f50])).
% 0.16/0.33 thf(f12,plain,(
% 0.16/0.33 ( ! [X3 : $o] : (($false = vAPP($o,$o,sK0,X3)) | ($false = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))) )),
% 0.16/0.33 inference(binary_proxy_clausification,[],[f10])).
% 0.16/0.33 thf(f10,plain,(
% 0.16/0.33 ( ! [X3 : $o] : ((vAPP($o,$o,sK0,X3) != vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))) )),
% 0.16/0.33 inference(cnf_transformation,[],[f9])).
% 0.16/0.33 thf(f9,plain,(
% 0.16/0.33 ! [X3 : $o] : (vAPP($o,$o,sK0,X3) != vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))),
% 0.16/0.33 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8])).
% 0.16/0.33 thf(f8,plain,(
% 0.16/0.33 ? [X0 : $o > $o,X1 : a > $o,X2 : a > $o] : ! [X3 : $o] : (vAPP($o,$o,X0,X3) != vAPP($o,$o,X0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),X1)),X2)))) => ! [X3 : $o] : (vAPP($o,$o,sK0,X3) != vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))),
% 0.16/0.33 introduced(choice_axiom,[])).
% 0.16/0.33 thf(f7,plain,(
% 0.16/0.33 ? [X0 : $o > $o,X1 : a > $o,X2 : a > $o] : ! [X3 : $o] : (vAPP($o,$o,X0,X3) != vAPP($o,$o,X0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),X1)),X2))))),
% 0.16/0.33 inference(ennf_transformation,[],[f6])).
% 0.16/0.33 thf(f6,plain,(
% 0.16/0.33 ~! [X0 : $o > $o,X1 : a > $o,X2 : a > $o] : ? [X3 : $o] : (vAPP($o,$o,X0,X3) = vAPP($o,$o,X0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),X1)),X2))))),
% 0.16/0.33 inference(fool_elimination,[],[f5])).
% 0.16/0.33 thf(f5,plain,(
% 0.16/0.33 ~! [X0 : $o > $o,X1,X2] : ? [X3 : $o] : (vAPP($o,$o,X0,X3) <=> vAPP($o,$o,X0,! [X4 : a] : (vAPP(a,$o,X2,X4) | vAPP(a,$o,X1,X4))))),
% 0.16/0.33 inference(rectify,[],[f2])).
% 0.16/0.33 thf(f2,negated_conjecture,(
% 0.16/0.33 ~! [X0 : $o > $o,X1 : a > $o,X2 : a > $o] : ? [X3 : $o] : (vAPP($o,$o,X0,X3) <=> vAPP($o,$o,X0,! [X4 : a] : (vAPP(a,$o,X2,X4) | vAPP(a,$o,X1,X4))))),
% 0.16/0.33 inference(negated_conjecture,[],[f1])).
% 0.16/0.33 thf(f1,conjecture,(
% 0.16/0.33 ! [X0 : $o > $o,X1 : a > $o,X2 : a > $o] : ? [X3 : $o] : (vAPP($o,$o,X0,X3) <=> vAPP($o,$o,X0,! [X4 : a] : (vAPP(a,$o,X2,X4) | vAPP(a,$o,X1,X4))))),
% 0.16/0.33 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM121)).
% 0.16/0.33 thf(f48,plain,(
% 0.16/0.33 spl3_1 | spl3_2),
% 0.16/0.33 inference(avatar_split_clause,[],[f11,f46,f42])).
% 0.16/0.33 thf(f11,plain,(
% 0.16/0.33 ( ! [X3 : $o] : (($true = vAPP($o,$o,sK0,X3)) | ($true = vAPP($o,$o,sK0,vAPP(sTfun(a,$o),$o,vPI(a),vAPP(sTfun(a,$o),sTfun(a,$o),vAPP(sTfun(a,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,$o)),sCOMB,vAPP(sTfun(a,$o),sTfun(a,sTfun($o,$o)),vAPP(sTfun($o,sTfun($o,$o)),sTfun(sTfun(a,$o),sTfun(a,sTfun($o,$o))),bCOMB,vOR),sK1)),sK2))))) )),
% 0.16/0.33 inference(binary_proxy_clausification,[],[f10])).
% 0.16/0.33 % SZS output end Proof for theBenchmark
% 0.16/0.33 % (27911)------------------------------
% 0.16/0.33 % (27911)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.33 % (27911)Termination reason: Refutation
% 0.16/0.33
% 0.16/0.33 % (27911)Memory used [KB]: 784
% 0.16/0.33 % (27911)Time elapsed: 0.006 s
% 0.16/0.33 % (27911)Instructions burned: 8 (million)
% 0.16/0.33 % (27908)Success in time 0.007 s
%------------------------------------------------------------------------------