TSTP Solution File: SEU537^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU537^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 : n010.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:49:26 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU537^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.14 % 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.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sun May 19 16:47:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 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.15/0.38 % (1344)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.38 % (1344)Instruction limit reached!
% 0.15/0.38 % (1344)------------------------------
% 0.15/0.38 % (1344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (1344)Termination reason: Unknown
% 0.15/0.38 % (1344)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (1344)Memory used [KB]: 5500
% 0.15/0.38 % (1344)Time elapsed: 0.003 s
% 0.15/0.38 % (1344)Instructions burned: 2 (million)
% 0.15/0.38 % (1344)------------------------------
% 0.15/0.38 % (1344)------------------------------
% 0.15/0.38 % (1341)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.38 % (1343)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.38 % (1342)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.38 % (1345)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.38 % (1347)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.38 % (1346)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.38 % (1348)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.38 % (1345)Instruction limit reached!
% 0.15/0.38 % (1345)------------------------------
% 0.15/0.38 % (1345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (1345)Termination reason: Unknown
% 0.15/0.38 % (1345)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (1345)Memory used [KB]: 895
% 0.15/0.38 % (1345)Time elapsed: 0.003 s
% 0.15/0.38 % (1345)Instructions burned: 2 (million)
% 0.15/0.38 % (1345)------------------------------
% 0.15/0.38 % (1345)------------------------------
% 0.15/0.38 % (1341)First to succeed.
% 0.15/0.38 % (1342)Also succeeded, but the first one will report.
% 0.15/0.38 % (1341)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.38 thf(func_def_5, type, sK1: $i > $o).
% 0.15/0.38 thf(f17,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(subsumption_resolution,[],[f16,f14])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ((sK1 @ sK2) = $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 (((sK1 @ sK2) = $true) & ($true = (in @ sK2 @ sK0))) & ! [X3] : (($true != (sK1 @ X3)) | ($true != (in @ X3 @ sK0)))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f10,f9])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 ? [X0,X1 : $i > $o] : (? [X2] : (((X1 @ X2) = $true) & ((in @ X2 @ X0) = $true)) & ! [X3] : (($true != (X1 @ X3)) | ($true != (in @ X3 @ X0)))) => (? [X2] : (($true = (sK1 @ X2)) & ($true = (in @ X2 @ sK0))) & ! [X3] : (($true != (sK1 @ X3)) | ($true != (in @ X3 @ sK0))))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ? [X2] : (($true = (sK1 @ X2)) & ($true = (in @ X2 @ sK0))) => (((sK1 @ sK2) = $true) & ($true = (in @ sK2 @ sK0)))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 ? [X0,X1 : $i > $o] : (? [X2] : (((X1 @ X2) = $true) & ((in @ X2 @ X0) = $true)) & ! [X3] : (($true != (X1 @ X3)) | ($true != (in @ X3 @ X0))))),
% 0.15/0.38 inference(rectify,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 ? [X0,X1 : $i > $o] : (? [X3] : (($true = (X1 @ X3)) & ($true = (in @ X3 @ X0))) & ! [X2] : (((X1 @ X2) != $true) | ((in @ X2 @ X0) != $true)))),
% 0.15/0.38 inference(ennf_transformation,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 ~! [X0,X1 : $i > $o] : (! [X2] : (((in @ X2 @ X0) = $true) => ((X1 @ X2) != $true)) => ~? [X3] : (($true = (X1 @ X3)) & ($true = (in @ X3 @ X0))))),
% 0.15/0.38 inference(flattening,[],[f5])).
% 0.15/0.38 thf(f5,plain,(
% 0.15/0.38 ~! [X0,X1 : $i > $o] : (! [X2] : (((in @ X2 @ X0) = $true) => ~((X1 @ X2) = $true)) => ~? [X3] : (($true = (X1 @ X3)) & ($true = (in @ X3 @ X0))))),
% 0.15/0.38 inference(fool_elimination,[],[f4])).
% 0.15/0.38 thf(f4,plain,(
% 0.15/0.38 ~! [X0,X1 : $i > $o] : (! [X2] : ((in @ X2 @ X0) => ~(X1 @ X2)) => ~? [X3] : ((in @ X3 @ X0) & (X1 @ X3)))),
% 0.15/0.38 inference(rectify,[],[f2])).
% 0.15/0.38 thf(f2,negated_conjecture,(
% 0.15/0.38 ~! [X0,X1 : $i > $o] : (! [X2] : ((in @ X2 @ X0) => ~(X1 @ X2)) => ~? [X2] : ((in @ X2 @ X0) & (X1 @ X2)))),
% 0.15/0.38 inference(negated_conjecture,[],[f1])).
% 0.15/0.38 thf(f1,conjecture,(
% 0.15/0.38 ! [X0,X1 : $i > $o] : (! [X2] : ((in @ X2 @ X0) => ~(X1 @ X2)) => ~? [X2] : ((in @ X2 @ X0) & (X1 @ X2)))),
% 0.15/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',quantDeMorgan2)).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 ((sK1 @ sK2) != $true)),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f15])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ($true != $true) | ((sK1 @ sK2) != $true)),
% 0.15/0.38 inference(superposition,[],[f12,f13])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ($true = (in @ sK2 @ sK0))),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 ( ! [X3 : $i] : (($true != (in @ X3 @ sK0)) | ($true != (sK1 @ X3))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f11])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (1341)------------------------------
% 0.15/0.38 % (1341)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (1341)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (1341)Memory used [KB]: 5500
% 0.15/0.38 % (1341)Time elapsed: 0.004 s
% 0.15/0.38 % (1341)Instructions burned: 1 (million)
% 0.15/0.38 % (1341)------------------------------
% 0.15/0.38 % (1341)------------------------------
% 0.15/0.38 % (1340)Success in time 0.005 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------