TSTP Solution File: SYO214^5 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SYO214^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 : n021.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:38 EDT 2024
% Result : Theorem 0.16s 0.40s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : SYO214^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.38 % Computer : n021.cluster.edu
% 0.16/0.38 % Model : x86_64 x86_64
% 0.16/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.38 % Memory : 8042.1875MB
% 0.16/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 300
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Mon May 20 10:31:53 EDT 2024
% 0.16/0.38 % CPUTime :
% 0.16/0.38 % (4499)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.39 % (4505)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.39 % (4503)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.39 % (4501)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.40 % (4505)First to succeed.
% 0.16/0.40 % Exception at run slice level
% 0.16/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.40 % Exception at run slice level
% 0.16/0.40 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.40 % (4502)WARNING: value z3 for option sas not known
% 0.16/0.40 % (4505)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4499"
% 0.16/0.40 % (4505)Refutation found. Thanks to Tanya!
% 0.16/0.40 % SZS status Theorem for theBenchmark
% 0.16/0.40 % SZS output start Proof for theBenchmark
% 0.16/0.40 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.16/0.40 thf(func_def_3, type, sK0: $i > $o).
% 0.16/0.40 thf(func_def_4, type, sK1: $i > $o).
% 0.16/0.40 thf(func_def_6, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
% 0.16/0.40 thf(func_def_7, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
% 0.16/0.40 thf(func_def_8, type, vAND: $o > $o > $o).
% 0.16/0.40 thf(func_def_9, type, vOR: $o > $o > $o).
% 0.16/0.40 thf(func_def_10, type, vIMP: $o > $o > $o).
% 0.16/0.40 thf(func_def_11, type, vNOT: $o > $o).
% 0.16/0.40 thf(func_def_12, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
% 0.16/0.40 thf(f16,plain,(
% 0.16/0.40 $false),
% 0.16/0.40 inference(trivial_inequality_removal,[],[f15])).
% 0.16/0.40 thf(f15,plain,(
% 0.16/0.40 ($true != $true)),
% 0.16/0.40 inference(superposition,[],[f13,f14])).
% 0.16/0.40 thf(f14,plain,(
% 0.16/0.40 ($true = vAPP($i,$o,sK0,sK2))),
% 0.16/0.40 inference(forward_demodulation,[],[f12,f11])).
% 0.16/0.40 thf(f11,plain,(
% 0.16/0.40 (sK0 = sK1)),
% 0.16/0.40 inference(cnf_transformation,[],[f10])).
% 0.16/0.40 thf(f10,plain,(
% 0.16/0.40 (($true != vAPP($i,$o,sK0,sK2)) & ($true = vAPP($i,$o,sK1,sK2))) & (sK0 = sK1)),
% 0.16/0.40 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f9,f8])).
% 0.16/0.40 thf(f8,plain,(
% 0.16/0.40 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : ((vAPP($i,$o,X0,X2) != $true) & (vAPP($i,$o,X1,X2) = $true)) & (X0 = X1)) => (? [X2] : (($true != vAPP($i,$o,sK0,X2)) & ($true = vAPP($i,$o,sK1,X2))) & (sK0 = sK1))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f9,plain,(
% 0.16/0.40 ? [X2] : (($true != vAPP($i,$o,sK0,X2)) & ($true = vAPP($i,$o,sK1,X2))) => (($true != vAPP($i,$o,sK0,sK2)) & ($true = vAPP($i,$o,sK1,sK2)))),
% 0.16/0.40 introduced(choice_axiom,[])).
% 0.16/0.40 thf(f7,plain,(
% 0.16/0.40 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : ((vAPP($i,$o,X0,X2) != $true) & (vAPP($i,$o,X1,X2) = $true)) & (X0 = X1))),
% 0.16/0.40 inference(ennf_transformation,[],[f6])).
% 0.16/0.40 thf(f6,plain,(
% 0.16/0.40 ~! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : ((vAPP($i,$o,X1,X2) = $true) => (vAPP($i,$o,X0,X2) = $true)))),
% 0.16/0.40 inference(fool_elimination,[],[f5])).
% 0.16/0.40 thf(f5,plain,(
% 0.16/0.40 ~! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : (vAPP($i,$o,X1,X2) => vAPP($i,$o,X0,X2)))),
% 0.16/0.40 inference(rectify,[],[f2])).
% 0.16/0.40 thf(f2,negated_conjecture,(
% 0.16/0.40 ~! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : (vAPP($i,$o,X1,X2) => vAPP($i,$o,X0,X2)))),
% 0.16/0.40 inference(negated_conjecture,[],[f1])).
% 0.16/0.40 thf(f1,conjecture,(
% 0.16/0.40 ! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : (vAPP($i,$o,X1,X2) => vAPP($i,$o,X0,X2)))),
% 0.16/0.40 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM12)).
% 0.16/0.40 thf(f12,plain,(
% 0.16/0.40 ($true = vAPP($i,$o,sK1,sK2))),
% 0.16/0.40 inference(cnf_transformation,[],[f10])).
% 0.16/0.40 thf(f13,plain,(
% 0.16/0.40 ($true != vAPP($i,$o,sK0,sK2))),
% 0.16/0.40 inference(cnf_transformation,[],[f10])).
% 0.16/0.40 % SZS output end Proof for theBenchmark
% 0.16/0.40 % (4505)------------------------------
% 0.16/0.40 % (4505)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.40 % (4505)Termination reason: Refutation
% 0.16/0.40
% 0.16/0.40 % (4505)Memory used [KB]: 742
% 0.16/0.40 % (4505)Time elapsed: 0.003 s
% 0.16/0.40 % (4505)Instructions burned: 3 (million)
% 0.16/0.40 % (4499)Success in time 0.013 s
%------------------------------------------------------------------------------