TSTP Solution File: SEU693^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU693^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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 03:50:48 EDT 2024
% Result : Theorem 0.15s 0.32s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEU693^2 : TPTP v8.2.0. Released v3.7.0.
% 0.08/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.30 % Computer : n014.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 17:30:22 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 This is a TH0_THM_EQU_NAR problem
% 0.10/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.32 % (9213)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 (3000ds/27Mi)
% 0.15/0.32 % (9216)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 (3000ds/275Mi)
% 0.15/0.32 % (9215)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 (3000ds/2Mi)
% 0.15/0.32 % (9218)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.15/0.32 % (9212)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 (3000ds/4Mi)
% 0.15/0.32 % (9215)Instruction limit reached!
% 0.15/0.32 % (9215)------------------------------
% 0.15/0.32 % (9215)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9215)Termination reason: Unknown
% 0.15/0.32 % (9215)Termination phase: Saturation
% 0.15/0.32
% 0.15/0.32 % (9215)Memory used [KB]: 895
% 0.15/0.32 % (9215)Time elapsed: 0.002 s
% 0.15/0.32 % (9215)Instructions burned: 2 (million)
% 0.15/0.32 % (9215)------------------------------
% 0.15/0.32 % (9215)------------------------------
% 0.15/0.32 % (9216)First to succeed.
% 0.15/0.32 % (9211)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.15/0.32 % (9214)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.32 % (9217)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.15/0.32 % (9218)Also succeeded, but the first one will report.
% 0.15/0.32 % (9212)Also succeeded, but the first one will report.
% 0.15/0.32 % (9216)Refutation found. Thanks to Tanya!
% 0.15/0.32 % SZS status Theorem for theBenchmark
% 0.15/0.32 % SZS output start Proof for theBenchmark
% 0.15/0.32 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.32 thf(func_def_1, type, funcSet: $i > $i > $i).
% 0.15/0.32 thf(func_def_2, type, ap: $i > $i > $i > $i > $i).
% 0.15/0.32 thf(f14,plain,(
% 0.15/0.32 $false),
% 0.15/0.32 inference(trivial_inequality_removal,[],[f12])).
% 0.15/0.32 thf(f12,plain,(
% 0.15/0.32 ((ap @ sK1 @ sK0 @ sK2 @ sK3) != (ap @ sK1 @ sK0 @ sK2 @ sK3))),
% 0.15/0.32 inference(cnf_transformation,[],[f10])).
% 0.15/0.32 thf(f10,plain,(
% 0.15/0.32 (((in @ sK3 @ sK1) = $true) & ((ap @ sK1 @ sK0 @ sK2 @ sK3) != (ap @ sK1 @ sK0 @ sK2 @ sK3))) & ($true = (in @ sK2 @ (funcSet @ sK1 @ sK0)))),
% 0.15/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f7,f9,f8])).
% 0.15/0.32 thf(f8,plain,(
% 0.15/0.32 ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X1)) & ((ap @ X1 @ X0 @ X2 @ X3) != (ap @ X1 @ X0 @ X2 @ X3))) & ($true = (in @ X2 @ (funcSet @ X1 @ X0)))) => (? [X3] : (((in @ X3 @ sK1) = $true) & ((ap @ sK1 @ sK0 @ sK2 @ X3) != (ap @ sK1 @ sK0 @ sK2 @ X3))) & ($true = (in @ sK2 @ (funcSet @ sK1 @ sK0))))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f9,plain,(
% 0.15/0.32 ? [X3] : (((in @ X3 @ sK1) = $true) & ((ap @ sK1 @ sK0 @ sK2 @ X3) != (ap @ sK1 @ sK0 @ sK2 @ X3))) => (((in @ sK3 @ sK1) = $true) & ((ap @ sK1 @ sK0 @ sK2 @ sK3) != (ap @ sK1 @ sK0 @ sK2 @ sK3)))),
% 0.15/0.32 introduced(choice_axiom,[])).
% 0.15/0.32 thf(f7,plain,(
% 0.15/0.32 ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X1)) & ((ap @ X1 @ X0 @ X2 @ X3) != (ap @ X1 @ X0 @ X2 @ X3))) & ($true = (in @ X2 @ (funcSet @ X1 @ X0))))),
% 0.15/0.32 inference(rectify,[],[f6])).
% 0.15/0.32 thf(f6,plain,(
% 0.15/0.32 ? [X1,X2,X0] : (? [X3] : (($true = (in @ X3 @ X2)) & ((ap @ X2 @ X1 @ X0 @ X3) != (ap @ X2 @ X1 @ X0 @ X3))) & ($true = (in @ X0 @ (funcSet @ X2 @ X1))))),
% 0.15/0.32 inference(ennf_transformation,[],[f5])).
% 0.15/0.32 thf(f5,plain,(
% 0.15/0.32 ~! [X0,X2,X1] : (($true = (in @ X0 @ (funcSet @ X2 @ X1))) => ! [X3] : (($true = (in @ X3 @ X2)) => ((ap @ X2 @ X1 @ X0 @ X3) = (ap @ X2 @ X1 @ X0 @ X3))))),
% 0.15/0.32 inference(fool_elimination,[],[f4])).
% 0.15/0.32 thf(f4,plain,(
% 0.15/0.32 ~! [X0,X1,X2] : ((in @ X0 @ (funcSet @ X2 @ X1)) => ! [X3] : ((in @ X3 @ X2) => ((ap @ X2 @ X1 @ X0 @ X3) = (ap @ X2 @ X1 @ X0 @ X3))))),
% 0.15/0.32 inference(rectify,[],[f2])).
% 0.15/0.32 thf(f2,negated_conjecture,(
% 0.15/0.32 ~! [X2,X1,X0] : ((in @ X2 @ (funcSet @ X0 @ X1)) => ! [X3] : ((in @ X3 @ X0) => ((ap @ X0 @ X1 @ X2 @ X3) = (ap @ X0 @ X1 @ X2 @ X3))))),
% 0.15/0.32 inference(negated_conjecture,[],[f1])).
% 0.15/0.32 thf(f1,conjecture,(
% 0.15/0.32 ! [X2,X1,X0] : ((in @ X2 @ (funcSet @ X0 @ X1)) => ! [X3] : ((in @ X3 @ X0) => ((ap @ X0 @ X1 @ X2 @ X3) = (ap @ X0 @ X1 @ X2 @ X3))))),
% 0.15/0.32 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ap2apEq1)).
% 0.15/0.32 % SZS output end Proof for theBenchmark
% 0.15/0.32 % (9216)------------------------------
% 0.15/0.32 % (9216)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.32 % (9216)Termination reason: Refutation
% 0.15/0.32
% 0.15/0.32 % (9216)Memory used [KB]: 5373
% 0.15/0.32 % (9216)Time elapsed: 0.002 s
% 0.15/0.32 % (9216)Instructions burned: 2 (million)
% 0.15/0.32 % (9216)------------------------------
% 0.15/0.32 % (9216)------------------------------
% 0.15/0.32 % (9210)Success in time 0.003 s
% 0.15/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------