TSTP Solution File: SEV047^5 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SEV047^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire %s %d THM
% Computer : n023.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:01:36 EDT 2024
% Result : Theorem 0.11s 0.37s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEV047^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.12 % Command : run_vampire %s %d THM
% 0.11/0.33 % Computer : n023.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Fri Jun 21 18:51:39 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.35 Running higher-order theorem proving
% 0.11/0.35 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.11/0.37 % (15868)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.11/0.37 % (15872)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.11/0.37 % (15873)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.11/0.37 % (15870)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.11/0.37 % (15871)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.11/0.37 % (15874)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.11/0.37 % (15869)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.11/0.37 % (15868)First to succeed.
% 0.11/0.37 % (15872)Instruction limit reached!
% 0.11/0.37 % (15872)------------------------------
% 0.11/0.37 % (15872)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.37 % (15872)Termination reason: Unknown
% 0.11/0.37 % (15872)Termination phase: Saturation
% 0.11/0.37
% 0.11/0.37 % (15872)Memory used [KB]: 5500
% 0.11/0.37 % (15872)Time elapsed: 0.004 s
% 0.11/0.37 % (15872)Instructions burned: 2 (million)
% 0.11/0.37 % (15872)------------------------------
% 0.11/0.37 % (15872)------------------------------
% 0.11/0.37 % (15874)Also succeeded, but the first one will report.
% 0.11/0.37 % (15869)Also succeeded, but the first one will report.
% 0.11/0.37 % (15868)Refutation found. Thanks to Tanya!
% 0.11/0.37 % SZS status Theorem for theBenchmark
% 0.11/0.37 % SZS output start Proof for theBenchmark
% 0.11/0.37 thf(func_def_3, type, sK0: $i > $i > $o).
% 0.11/0.37 thf(f12,plain,(
% 0.11/0.37 $false),
% 0.11/0.37 inference(subsumption_resolution,[],[f10,f11])).
% 0.11/0.37 thf(f11,plain,(
% 0.11/0.37 ((sK0 @ sK2 @ sK1) != $true)),
% 0.11/0.37 inference(cnf_transformation,[],[f9])).
% 0.11/0.37 thf(f9,plain,(
% 0.11/0.37 ((sK0 @ sK2 @ sK1) != $true) & ((sK0 @ sK2 @ sK1) = $true)),
% 0.11/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f7,f8])).
% 0.11/0.37 thf(f8,plain,(
% 0.11/0.37 ? [X0 : $i > $i > $o,X1,X2] : (((X0 @ X2 @ X1) != $true) & ((X0 @ X2 @ X1) = $true)) => (((sK0 @ sK2 @ sK1) != $true) & ((sK0 @ sK2 @ sK1) = $true))),
% 0.11/0.37 introduced(choice_axiom,[])).
% 0.11/0.37 thf(f7,plain,(
% 0.11/0.37 ? [X0 : $i > $i > $o,X1,X2] : (((X0 @ X2 @ X1) != $true) & ((X0 @ X2 @ X1) = $true))),
% 0.11/0.37 inference(rectify,[],[f6])).
% 0.11/0.37 thf(f6,plain,(
% 0.11/0.37 ? [X2 : $i > $i > $o,X1,X0] : (((X2 @ X0 @ X1) != $true) & ((X2 @ X0 @ X1) = $true))),
% 0.11/0.37 inference(ennf_transformation,[],[f5])).
% 0.11/0.37 thf(f5,plain,(
% 0.11/0.37 ~! [X0,X2 : $i > $i > $o,X1] : (((X2 @ X0 @ X1) = $true) => ((X2 @ X0 @ X1) = $true))),
% 0.11/0.37 inference(fool_elimination,[],[f4])).
% 0.11/0.37 thf(f4,plain,(
% 0.11/0.37 ~! [X0,X1,X2 : $i > $i > $o] : ((X2 @ X0 @ X1) => (X2 @ X0 @ X1))),
% 0.11/0.37 inference(rectify,[],[f2])).
% 0.11/0.37 thf(f2,negated_conjecture,(
% 0.11/0.37 ~! [X1,X2,X0 : $i > $i > $o] : ((X0 @ X1 @ X2) => (X0 @ X1 @ X2))),
% 0.11/0.37 inference(negated_conjecture,[],[f1])).
% 0.11/0.37 thf(f1,conjecture,(
% 0.11/0.37 ! [X1,X2,X0 : $i > $i > $o] : ((X0 @ X1 @ X2) => (X0 @ X1 @ X2))),
% 0.11/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM175_pme)).
% 0.11/0.37 thf(f10,plain,(
% 0.11/0.37 ((sK0 @ sK2 @ sK1) = $true)),
% 0.11/0.37 inference(cnf_transformation,[],[f9])).
% 0.11/0.37 % SZS output end Proof for theBenchmark
% 0.11/0.37 % (15868)------------------------------
% 0.11/0.37 % (15868)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.11/0.37 % (15868)Termination reason: Refutation
% 0.11/0.37
% 0.11/0.37 % (15868)Memory used [KB]: 5373
% 0.11/0.37 % (15868)Time elapsed: 0.004 s
% 0.11/0.37 % (15868)Instructions burned: 1 (million)
% 0.11/0.37 % (15868)------------------------------
% 0.11/0.37 % (15868)------------------------------
% 0.11/0.37 % (15867)Success in time 0.007 s
%------------------------------------------------------------------------------