TSTP Solution File: SEV176^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV176^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n019.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 : Mon Jun 24 16:02:08 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 : SEV176^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.12 % Command : run_vampire %s %d THM
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Jun 21 18:39:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.20/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.20/0.36 Running higher-order theorem proving
% 0.20/0.36 Running /export/starexec/sandbox2/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox2/benchmark/theBenchmark.p -m 16384 -t 300
% 0.20/0.38 % (13105)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.38 % (13107)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.38 % (13104)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.20/0.38 % (13106)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.20/0.38 % (13108)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.38 % (13109)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.20/0.38 % (13110)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.20/0.38 % (13107)Instruction limit reached!
% 0.20/0.38 % (13107)------------------------------
% 0.20/0.38 % (13107)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13107)Termination reason: Unknown
% 0.20/0.38 % (13108)Instruction limit reached!
% 0.20/0.38 % (13108)------------------------------
% 0.20/0.38 % (13108)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13108)Termination reason: Unknown
% 0.20/0.38 % (13108)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (13108)Memory used [KB]: 5500
% 0.20/0.38 % (13108)Time elapsed: 0.004 s
% 0.20/0.38 % (13108)Instructions burned: 2 (million)
% 0.20/0.38 % (13108)------------------------------
% 0.20/0.38 % (13108)------------------------------
% 0.20/0.38 % (13107)Termination phase: Saturation
% 0.20/0.38
% 0.20/0.38 % (13107)Memory used [KB]: 5500
% 0.20/0.38 % (13107)Time elapsed: 0.004 s
% 0.20/0.38 % (13107)Instructions burned: 2 (million)
% 0.20/0.38 % (13107)------------------------------
% 0.20/0.38 % (13107)------------------------------
% 0.20/0.38 % (13109)First to succeed.
% 0.20/0.38 % (13104)Also succeeded, but the first one will report.
% 0.20/0.38 % (13105)Also succeeded, but the first one will report.
% 0.20/0.39 % (13109)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(func_def_0, type, cR: $i > $i > $o).
% 0.20/0.39 thf(func_def_5, type, sK1: $i > $i).
% 0.20/0.39 thf(f24,plain,(
% 0.20/0.39 $false),
% 0.20/0.39 inference(subsumption_resolution,[],[f23,f13])).
% 0.20/0.39 thf(f13,plain,(
% 0.20/0.39 ( ! [X3 : $i,X1 : $i] : (($true != (cR @ X1 @ sK0)) | ((cR @ X3 @ X1) != $true) | ($true != (cR @ X1 @ X3))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f12])).
% 0.20/0.39 thf(f12,plain,(
% 0.20/0.39 ! [X1] : ((($true = (cR @ X1 @ sK0)) | (((cR @ X1 @ (sK1 @ X1)) = $true) & ((cR @ (sK1 @ X1) @ X1) = $true))) & (! [X3] : (($true != (cR @ X1 @ X3)) | ((cR @ X3 @ X1) != $true)) | ($true != (cR @ X1 @ sK0))))),
% 0.20/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11,f10])).
% 0.20/0.39 thf(f10,plain,(
% 0.20/0.39 ? [X0] : ! [X1] : ((((cR @ X1 @ X0) = $true) | ? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true))) & (! [X3] : (($true != (cR @ X1 @ X3)) | ((cR @ X3 @ X1) != $true)) | ((cR @ X1 @ X0) != $true))) => ! [X1] : ((($true = (cR @ X1 @ sK0)) | ? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true))) & (! [X3] : (($true != (cR @ X1 @ X3)) | ((cR @ X3 @ X1) != $true)) | ($true != (cR @ X1 @ sK0))))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f11,plain,(
% 0.20/0.39 ! [X1] : (? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true)) => (((cR @ X1 @ (sK1 @ X1)) = $true) & ((cR @ (sK1 @ X1) @ X1) = $true)))),
% 0.20/0.39 introduced(choice_axiom,[])).
% 0.20/0.39 thf(f9,plain,(
% 0.20/0.39 ? [X0] : ! [X1] : ((((cR @ X1 @ X0) = $true) | ? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true))) & (! [X3] : (($true != (cR @ X1 @ X3)) | ((cR @ X3 @ X1) != $true)) | ((cR @ X1 @ X0) != $true)))),
% 0.20/0.39 inference(rectify,[],[f8])).
% 0.20/0.39 thf(f8,plain,(
% 0.20/0.39 ? [X0] : ! [X1] : ((((cR @ X1 @ X0) = $true) | ? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true))) & (! [X2] : (((cR @ X1 @ X2) != $true) | ((cR @ X2 @ X1) != $true)) | ((cR @ X1 @ X0) != $true)))),
% 0.20/0.39 inference(nnf_transformation,[],[f7])).
% 0.20/0.39 thf(f7,plain,(
% 0.20/0.39 ? [X0] : ! [X1] : (((cR @ X1 @ X0) = $true) <=> ! [X2] : (((cR @ X1 @ X2) != $true) | ((cR @ X2 @ X1) != $true)))),
% 0.20/0.39 inference(ennf_transformation,[],[f6])).
% 0.20/0.39 thf(f6,plain,(
% 0.20/0.39 ? [X0] : ! [X1] : (((cR @ X1 @ X0) = $true) <=> ~? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true)))),
% 0.20/0.39 inference(flattening,[],[f5])).
% 0.20/0.39 thf(f5,plain,(
% 0.20/0.39 ~~? [X0] : ! [X1] : (((cR @ X1 @ X0) = $true) <=> ~? [X2] : (((cR @ X1 @ X2) = $true) & ((cR @ X2 @ X1) = $true)))),
% 0.20/0.39 inference(fool_elimination,[],[f4])).
% 0.20/0.39 thf(f4,plain,(
% 0.20/0.39 ~~? [X0] : ! [X1] : ((cR @ X1 @ X0) <=> ~? [X2] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.20/0.39 inference(rectify,[],[f2])).
% 0.20/0.39 thf(f2,negated_conjecture,(
% 0.20/0.39 ~~? [X0] : ! [X1] : ((cR @ X1 @ X0) <=> ~? [X2] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.20/0.39 inference(negated_conjecture,[],[f1])).
% 0.20/0.39 thf(f1,conjecture,(
% 0.20/0.39 ~? [X0] : ! [X1] : ((cR @ X1 @ X0) <=> ~? [X2] : ((cR @ X1 @ X2) & (cR @ X2 @ X1)))),
% 0.20/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM25)).
% 0.20/0.39 thf(f23,plain,(
% 0.20/0.39 ((cR @ sK0 @ sK0) = $true)),
% 0.20/0.39 inference(subsumption_resolution,[],[f22,f15])).
% 0.20/0.39 thf(f15,plain,(
% 0.20/0.39 ( ! [X1 : $i] : (((cR @ X1 @ (sK1 @ X1)) = $true) | ($true = (cR @ X1 @ sK0))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f12])).
% 0.20/0.39 thf(f22,plain,(
% 0.20/0.39 ((cR @ sK0 @ (sK1 @ sK0)) != $true) | ((cR @ sK0 @ sK0) = $true)),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f19])).
% 0.20/0.39 thf(f19,plain,(
% 0.20/0.39 ((cR @ sK0 @ (sK1 @ sK0)) != $true) | ((cR @ sK0 @ sK0) = $true) | ($true != $true)),
% 0.20/0.39 inference(superposition,[],[f18,f14])).
% 0.20/0.39 thf(f14,plain,(
% 0.20/0.39 ( ! [X1 : $i] : (((cR @ (sK1 @ X1) @ X1) = $true) | ($true = (cR @ X1 @ sK0))) )),
% 0.20/0.39 inference(cnf_transformation,[],[f12])).
% 0.20/0.39 thf(f18,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (($true != (cR @ (sK1 @ sK0) @ X0)) | ((cR @ X0 @ (sK1 @ sK0)) != $true)) )),
% 0.20/0.39 inference(subsumption_resolution,[],[f17,f13])).
% 0.20/0.39 thf(f17,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (($true != (cR @ (sK1 @ sK0) @ X0)) | ((cR @ sK0 @ sK0) = $true) | ((cR @ X0 @ (sK1 @ sK0)) != $true)) )),
% 0.20/0.39 inference(trivial_inequality_removal,[],[f16])).
% 0.20/0.39 thf(f16,plain,(
% 0.20/0.39 ( ! [X0 : $i] : (($true != (cR @ (sK1 @ sK0) @ X0)) | ((cR @ X0 @ (sK1 @ sK0)) != $true) | ((cR @ sK0 @ sK0) = $true) | ($true != $true)) )),
% 0.20/0.39 inference(superposition,[],[f13,f14])).
% 0.20/0.39 % SZS output end Proof for theBenchmark
% 0.20/0.39 % (13109)------------------------------
% 0.20/0.39 % (13109)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.39 % (13109)Termination reason: Refutation
% 0.20/0.39
% 0.20/0.39 % (13109)Memory used [KB]: 5500
% 0.20/0.39 % (13109)Time elapsed: 0.005 s
% 0.20/0.39 % (13109)Instructions burned: 2 (million)
% 0.20/0.39 % (13109)------------------------------
% 0.20/0.39 % (13109)------------------------------
% 0.20/0.39 % (13103)Success in time 0.009 s
%------------------------------------------------------------------------------