TSTP Solution File: SYO553^1 by Vampire---4.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.9
% Problem : SYO553^1 : TPTP v8.2.0. Released v5.2.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 21:03:53 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO553^1 : TPTP v8.2.0. Released v5.2.0.
% 0.07/0.12 % Command : run_vampire %s %d THM
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Jun 23 08:55:24 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 This is a TH0_THM_EQU_NAR problem
% 0.12/0.36 Running higher-order theorem proving
% 0.12/0.36 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/benchmark/theBenchmark.p -m 16384 -t 300
% 0.12/0.37 % (13299)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.12/0.37 % (13299)Refutation not found, incomplete strategy
% 0.12/0.37 % (13299)------------------------------
% 0.12/0.37 % (13299)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.12/0.37 % (13299)Termination reason: Refutation not found, incomplete strategy
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 % (13299)Memory used [KB]: 5373
% 0.12/0.37 % (13299)Time elapsed: 0.003 s
% 0.12/0.37 % (13299)Instructions burned: 1 (million)
% 0.12/0.37 % (13299)------------------------------
% 0.12/0.37 % (13299)------------------------------
% 0.20/0.38 % (13298)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 % (13297)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 % (13301)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 % (13302)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 % (13300)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.38 % (13297)First to succeed.
% 0.20/0.38 % (13302)Refutation not found, incomplete strategy
% 0.20/0.38 % (13302)------------------------------
% 0.20/0.38 % (13302)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13302)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (13302)Memory used [KB]: 5373
% 0.20/0.38 % (13302)Time elapsed: 0.003 s
% 0.20/0.38 % (13302)Instructions burned: 1 (million)
% 0.20/0.38 % (13302)------------------------------
% 0.20/0.38 % (13302)------------------------------
% 0.20/0.38 % (13303)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 % (13298)Also succeeded, but the first one will report.
% 0.20/0.38 % (13300)Refutation not found, incomplete strategy
% 0.20/0.38 % (13300)------------------------------
% 0.20/0.38 % (13300)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13300)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (13300)Memory used [KB]: 5373
% 0.20/0.38 % (13300)Time elapsed: 0.003 s
% 0.20/0.38 % (13300)Instructions burned: 1 (million)
% 0.20/0.38 % (13300)------------------------------
% 0.20/0.38 % (13300)------------------------------
% 0.20/0.38 % (13301)Refutation not found, incomplete strategy
% 0.20/0.38 % (13301)------------------------------
% 0.20/0.38 % (13301)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13301)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 % (13301)Memory used [KB]: 5500
% 0.20/0.38 % (13301)Time elapsed: 0.004 s
% 0.20/0.38 % (13301)Instructions burned: 1 (million)
% 0.20/0.38 % (13301)------------------------------
% 0.20/0.38 % (13301)------------------------------
% 0.20/0.38 % (13297)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for theBenchmark
% 0.20/0.38 % SZS output start Proof for theBenchmark
% 0.20/0.38 thf(func_def_3, type, sK0: ($i > $i > $i) > $i).
% 0.20/0.38 thf(func_def_4, type, sK1: ($i > $i > $i) > $i).
% 0.20/0.38 thf(func_def_6, type, ph3: !>[X0: $tType]:(X0)).
% 0.20/0.38 thf(f9,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(equality_resolution,[],[f8])).
% 0.20/0.38 thf(f8,plain,(
% 0.20/0.38 ( ! [X0 : $i > $i > $i] : (((X0 @ (sK1 @ X0) @ (sK0 @ X0)) != (sK0 @ X0))) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f7,plain,(
% 0.20/0.38 ! [X0 : $i > $i > $i] : ((X0 @ (sK1 @ X0) @ (sK0 @ X0)) != (sK0 @ X0))),
% 0.20/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f5,f6])).
% 0.20/0.38 thf(f6,plain,(
% 0.20/0.38 ! [X0 : $i > $i > $i] : (? [X1,X2] : ((X0 @ X2 @ X1) != X1) => ((X0 @ (sK1 @ X0) @ (sK0 @ X0)) != (sK0 @ X0)))),
% 0.20/0.38 introduced(choice_axiom,[])).
% 0.20/0.38 thf(f5,plain,(
% 0.20/0.38 ! [X0 : $i > $i > $i] : ? [X1,X2] : ((X0 @ X2 @ X1) != X1)),
% 0.20/0.38 inference(rectify,[],[f4])).
% 0.20/0.38 thf(f4,plain,(
% 0.20/0.38 ! [X0 : $i > $i > $i] : ? [X2,X1] : ((X0 @ X1 @ X2) != X2)),
% 0.20/0.38 inference(ennf_transformation,[],[f2])).
% 0.20/0.38 thf(f2,negated_conjecture,(
% 0.20/0.38 ~? [X0 : $i > $i > $i] : ! [X1,X2] : ((X0 @ X1 @ X2) = X2)),
% 0.20/0.38 inference(negated_conjecture,[],[f1])).
% 0.20/0.38 thf(f1,conjecture,(
% 0.20/0.38 ? [X0 : $i > $i > $i] : ! [X1,X2] : ((X0 @ X1 @ X2) = X2)),
% 0.20/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',claim)).
% 0.20/0.38 % SZS output end Proof for theBenchmark
% 0.20/0.38 % (13297)------------------------------
% 0.20/0.38 % (13297)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
% 0.20/0.38 % (13297)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (13297)Memory used [KB]: 5373
% 0.20/0.38 % (13297)Time elapsed: 0.004 s
% 0.20/0.38 % (13297)Instructions burned: 1 (million)
% 0.20/0.38 % (13297)------------------------------
% 0.20/0.38 % (13297)------------------------------
% 0.20/0.38 % (13295)Success in time 0.016 s
%------------------------------------------------------------------------------