TSTP Solution File: SEU536^2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEU536^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n016.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 04:05:49 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU536^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n016.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 : Sun May 19 16:23:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.37 % (3890)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.40 % (3893)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.15/0.40 % (3892)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.40 % (3894)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.40 % (3891)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.40 % (3896)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.40 % (3895)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.40 % (3897)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.15/0.40 % (3893)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.40 % (3894)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.40 % Exception at run slice level% Exception at run slice level% Exception at run slice level% Exception at run slice level
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 User error: 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 constructsFinite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40
% 0.15/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.40 % (3895)Also succeeded, but the first one will report.
% 0.15/0.40 % (3893)First to succeed.
% 0.15/0.40 % (3896)Also succeeded, but the first one will report.
% 0.15/0.40 % (3893)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3890"
% 0.15/0.40 % (3893)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% 0.15/0.40 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.15/0.40 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.40 thf(func_def_5, type, sK1: $i > $o).
% 0.15/0.40 thf(func_def_8, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.15/0.40 thf(func_def_9, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.15/0.40 thf(func_def_10, type, vAND: $o > $o > $o).
% 0.15/0.40 thf(func_def_11, type, vOR: $o > $o > $o).
% 0.15/0.40 thf(func_def_12, type, vIMP: $o > $o > $o).
% 0.15/0.40 thf(func_def_13, type, vNOT: $o > $o).
% 0.15/0.40 thf(func_def_14, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.15/0.40 thf(f54,plain,(
% 0.15/0.40 $false),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f53])).
% 0.15/0.40 thf(f53,plain,(
% 0.15/0.40 ($true = $false)),
% 0.15/0.40 inference(forward_demodulation,[],[f52,f27])).
% 0.15/0.40 thf(f27,plain,(
% 0.15/0.40 ($false = vAPP($i,$o,sK1,sK2))),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f25])).
% 0.15/0.40 thf(f25,plain,(
% 0.15/0.40 ($true != $true) | ($false = vAPP($i,$o,sK1,sK2))),
% 0.15/0.40 inference(superposition,[],[f14,f4])).
% 0.15/0.40 thf(f4,plain,(
% 0.15/0.40 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.15/0.40 introduced(fool_axiom,[])).
% 0.15/0.40 thf(f14,plain,(
% 0.15/0.40 ($true != vAPP($i,$o,sK1,sK2))),
% 0.15/0.40 inference(cnf_transformation,[],[f12])).
% 0.15/0.40 thf(f12,plain,(
% 0.15/0.40 ! [X2] : (($true = vAPP($i,$o,sK1,X2)) | ($true != vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),sK0))) & (($true != vAPP($i,$o,sK1,sK2)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,sK2),sK0)))),
% 0.15/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f11,f10])).
% 0.15/0.40 thf(f10,plain,(
% 0.15/0.40 ? [X0,X1 : $i > $o] : (! [X2] : ((vAPP($i,$o,X1,X2) = $true) | (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) != $true)) & ? [X3] : (($true != vAPP($i,$o,X1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0)))) => (! [X2] : (($true = vAPP($i,$o,sK1,X2)) | ($true != vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),sK0))) & ? [X3] : (($true != vAPP($i,$o,sK1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),sK0))))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f11,plain,(
% 0.15/0.40 ? [X3] : (($true != vAPP($i,$o,sK1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),sK0))) => (($true != vAPP($i,$o,sK1,sK2)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,sK2),sK0)))),
% 0.15/0.40 introduced(choice_axiom,[])).
% 0.15/0.40 thf(f9,plain,(
% 0.15/0.40 ? [X0,X1 : $i > $o] : (! [X2] : ((vAPP($i,$o,X1,X2) = $true) | (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) != $true)) & ? [X3] : (($true != vAPP($i,$o,X1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0))))),
% 0.15/0.40 inference(rectify,[],[f8])).
% 0.15/0.40 thf(f8,plain,(
% 0.15/0.40 ? [X0,X1 : $i > $o] : (! [X3] : (($true = vAPP($i,$o,X1,X3)) | ($true != vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0))) & ? [X2] : ((vAPP($i,$o,X1,X2) != $true) & (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) = $true)))),
% 0.15/0.40 inference(ennf_transformation,[],[f7])).
% 0.15/0.40 thf(f7,plain,(
% 0.15/0.40 ~! [X0,X1 : $i > $o] : (~! [X2] : ((vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) = $true) => (vAPP($i,$o,X1,X2) = $true)) => ? [X3] : (($true != vAPP($i,$o,X1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0))))),
% 0.15/0.40 inference(flattening,[],[f6])).
% 0.15/0.40 thf(f6,plain,(
% 0.15/0.40 ~! [X0,X1 : $i > $o] : (~! [X2] : ((vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) = $true) => (vAPP($i,$o,X1,X2) = $true)) => ? [X3] : (~($true = vAPP($i,$o,X1,X3)) & ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0))))),
% 0.15/0.40 inference(fool_elimination,[],[f5])).
% 0.15/0.40 thf(f5,plain,(
% 0.15/0.40 ~! [X0,X1 : $i > $o] : (~! [X2] : (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) => vAPP($i,$o,X1,X2)) => ? [X3] : (~vAPP($i,$o,X1,X3) & vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X3),X0)))),
% 0.15/0.40 inference(rectify,[],[f2])).
% 0.15/0.40 thf(f2,negated_conjecture,(
% 0.15/0.40 ~! [X0,X1 : $i > $o] : (~! [X2] : (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) => vAPP($i,$o,X1,X2)) => ? [X2] : (~vAPP($i,$o,X1,X2) & vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0)))),
% 0.15/0.40 inference(negated_conjecture,[],[f1])).
% 0.15/0.40 thf(f1,conjecture,(
% 0.15/0.40 ! [X0,X1 : $i > $o] : (~! [X2] : (vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0) => vAPP($i,$o,X1,X2)) => ? [X2] : (~vAPP($i,$o,X1,X2) & vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),X0)))),
% 0.15/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',quantDeMorgan1)).
% 0.15/0.40 thf(f52,plain,(
% 0.15/0.40 ($true = vAPP($i,$o,sK1,sK2))),
% 0.15/0.40 inference(trivial_inequality_removal,[],[f49])).
% 0.15/0.40 thf(f49,plain,(
% 0.15/0.40 ($true != $true) | ($true = vAPP($i,$o,sK1,sK2))),
% 0.15/0.40 inference(superposition,[],[f15,f13])).
% 0.15/0.40 thf(f13,plain,(
% 0.15/0.40 ($true = vAPP($i,$o,vAPP($i,sTfun($i,$o),in,sK2),sK0))),
% 0.15/0.40 inference(cnf_transformation,[],[f12])).
% 0.15/0.40 thf(f15,plain,(
% 0.15/0.40 ( ! [X2 : $i] : (($true != vAPP($i,$o,vAPP($i,sTfun($i,$o),in,X2),sK0)) | ($true = vAPP($i,$o,sK1,X2))) )),
% 0.15/0.40 inference(cnf_transformation,[],[f12])).
% 0.15/0.40 % SZS output end Proof for theBenchmark
% 0.15/0.40 % (3893)------------------------------
% 0.15/0.40 % (3893)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.40 % (3893)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (3893)Memory used [KB]: 766
% 0.15/0.40 % (3893)Time elapsed: 0.007 s
% 0.15/0.40 % (3893)Instructions burned: 4 (million)
% 0.15/0.40 % (3890)Success in time 0.035 s
%------------------------------------------------------------------------------