TSTP Solution File: SEU697^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU697^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n011.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:50 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU697^2 : TPTP v8.2.0. Released v3.7.0.
% 0.13/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 17:50:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_EQU_NAR problem
% 0.14/0.35 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/sandbox/benchmark/theBenchmark.p
% 0.20/0.36 % (8857)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.20/0.36 % (8858)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.20/0.36 % (8859)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.20/0.36 % (8854)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.20/0.36 % (8860)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.20/0.36 % (8857)Instruction limit reached!
% 0.20/0.36 % (8857)------------------------------
% 0.20/0.36 % (8857)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36 % (8857)Termination reason: Unknown
% 0.20/0.36 % (8858)Instruction limit reached!
% 0.20/0.36 % (8858)------------------------------
% 0.20/0.36 % (8858)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.36 % (8858)Termination reason: Unknown
% 0.20/0.36 % (8858)Termination phase: Saturation
% 0.20/0.36
% 0.20/0.36 % (8858)Memory used [KB]: 895
% 0.20/0.36 % (8858)Time elapsed: 0.003 s
% 0.20/0.36 % (8858)Instructions burned: 2 (million)
% 0.20/0.36 % (8858)------------------------------
% 0.20/0.36 % (8858)------------------------------
% 0.20/0.36 % (8857)Termination phase: Property scanning
% 0.20/0.36
% 0.20/0.36 % (8857)Memory used [KB]: 895
% 0.20/0.36 % (8857)Time elapsed: 0.003 s
% 0.20/0.36 % (8857)Instructions burned: 2 (million)
% 0.20/0.36 % (8857)------------------------------
% 0.20/0.36 % (8857)------------------------------
% 0.20/0.36 % (8859)First to succeed.
% 0.20/0.37 % (8855)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.20/0.37 % (8860)Also succeeded, but the first one will report.
% 0.20/0.37 % (8861)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.20/0.37 % (8854)Also succeeded, but the first one will report.
% 0.20/0.37 % (8859)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.20/0.37 thf(func_def_1, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.20/0.37 thf(func_def_2, type, lam: $i > $i > ($i > $i) > $i).
% 0.20/0.37 thf(func_def_12, type, sK1: $i > $i).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f11])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ((lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))) != (lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))))),
% 0.20/0.37 inference(cnf_transformation,[],[f10])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ! [X3] : (((in @ X3 @ sK0) != $true) | ($true = (in @ (sK1 @ X3) @ sK2))) & ((lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))) != (lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f9])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ? [X0,X1 : $i > $i,X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ($true = (in @ (X1 @ X3) @ X2))) & ((lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0))) != (lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0))))) => (! [X3] : (((in @ X3 @ sK0) != $true) | ($true = (in @ (sK1 @ X3) @ sK2))) & ((lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0))) != (lam @ sK0 @ sK2 @ (^[Y0 : $i]: (sK1 @ Y0)))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 ? [X0,X1 : $i > $i,X2] : (! [X3] : (((in @ X3 @ X0) != $true) | ($true = (in @ (X1 @ X3) @ X2))) & ((lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0))) != (lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))),
% 0.20/0.37 inference(ennf_transformation,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 ~! [X0,X1 : $i > $i,X2] : (! [X3] : (((in @ X3 @ X0) = $true) => ($true = (in @ (X1 @ X3) @ X2))) => ((lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0))) = (lam @ X0 @ X2 @ (^[Y0 : $i]: (X1 @ Y0)))))),
% 0.20/0.37 inference(fool_elimination,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 ~! [X0,X1 : $i > $i,X2] : (! [X3] : ((in @ X3 @ X0) => (in @ (X1 @ X3) @ X2)) => ((lam @ X0 @ X2 @ (^[X4 : $i] : (X1 @ X4))) = (lam @ X0 @ X2 @ (^[X5 : $i] : (X1 @ X5)))))),
% 0.20/0.37 inference(rectify,[],[f3])).
% 0.20/0.37 thf(f3,negated_conjecture,(
% 0.20/0.37 ~! [X0,X2 : $i > $i,X1] : (! [X3] : ((in @ X3 @ X0) => (in @ (X2 @ X3) @ X1)) => ((lam @ X0 @ X1 @ (^[X3 : $i] : (X2 @ X3))) = (lam @ X0 @ X1 @ (^[X3 : $i] : (X2 @ X3)))))),
% 0.20/0.37 inference(negated_conjecture,[],[f2])).
% 0.20/0.37 thf(f2,conjecture,(
% 0.20/0.37 ! [X0,X2 : $i > $i,X1] : (! [X3] : ((in @ X3 @ X0) => (in @ (X2 @ X3) @ X1)) => ((lam @ X0 @ X1 @ (^[X3 : $i] : (X2 @ X3))) = (lam @ X0 @ X1 @ (^[X3 : $i] : (X2 @ X3)))))),
% 0.20/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',lam2lamEq)).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (8859)------------------------------
% 0.20/0.37 % (8859)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (8859)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (8859)Memory used [KB]: 5373
% 0.20/0.37 % (8859)Time elapsed: 0.004 s
% 0.20/0.37 % (8859)Instructions burned: 2 (million)
% 0.20/0.37 % (8859)------------------------------
% 0.20/0.37 % (8859)------------------------------
% 0.20/0.37 % (8853)Success in time 0.005 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------