TSTP Solution File: SEU662^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU662^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 : n016.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:25 EDT 2024

% Result   : Theorem 0.15s 0.37s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SEU662^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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.15/0.34  % Computer : n016.cluster.edu
% 0.15/0.34  % Model    : x86_64 x86_64
% 0.15/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34  % Memory   : 8042.1875MB
% 0.15/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34  % CPULimit   : 300
% 0.15/0.34  % WCLimit    : 300
% 0.15/0.34  % DateTime   : Sun May 19 15:28:07 EDT 2024
% 0.15/0.34  % CPUTime    : 
% 0.15/0.34  This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.36  % (6620)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.15/0.36  % (6619)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.36  % (6618)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.15/0.36  % (6617)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.15/0.36  % (6613)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.15/0.36  % (6615)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.15/0.36  % (6617)Instruction limit reached!
% 0.15/0.36  % (6617)------------------------------
% 0.15/0.36  % (6617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.36  % (6617)Termination reason: Unknown
% 0.15/0.36  % (6617)Termination phase: Clausification
% 0.15/0.36  
% 0.15/0.36  % (6617)Memory used [KB]: 895
% 0.15/0.36  % (6617)Time elapsed: 0.003 s
% 0.15/0.36  % (6617)Instructions burned: 2 (million)
% 0.15/0.36  % (6617)------------------------------
% 0.15/0.36  % (6617)------------------------------
% 0.15/0.36  % (6614)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.15/0.36  % (6616)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37  % (6618)First to succeed.
% 0.15/0.37  % (6620)Instruction limit reached!
% 0.15/0.37  % (6620)------------------------------
% 0.15/0.37  % (6620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (6620)Termination reason: Unknown
% 0.15/0.37  % (6620)Termination phase: Saturation
% 0.15/0.37  
% 0.15/0.37  % (6620)Memory used [KB]: 5500
% 0.15/0.37  % (6620)Time elapsed: 0.004 s
% 0.15/0.37  % (6616)Instruction limit reached!
% 0.15/0.37  % (6616)------------------------------
% 0.15/0.37  % (6616)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (6616)Termination reason: Unknown
% 0.15/0.37  % (6616)Termination phase: Property scanning
% 0.15/0.37  
% 0.15/0.37  % (6616)Memory used [KB]: 895
% 0.15/0.37  % (6616)Time elapsed: 0.003 s
% 0.15/0.37  % (6616)Instructions burned: 2 (million)
% 0.15/0.37  % (6616)------------------------------
% 0.15/0.37  % (6616)------------------------------
% 0.15/0.37  % (6620)Instructions burned: 3 (million)
% 0.15/0.37  % (6620)------------------------------
% 0.15/0.37  % (6620)------------------------------
% 0.15/0.37  % (6619)Also succeeded, but the first one will report.
% 0.15/0.37  % (6613)Also succeeded, but the first one will report.
% 0.15/0.37  % (6618)Refutation found. Thanks to Tanya!
% 0.15/0.37  % SZS status Theorem for theBenchmark
% 0.15/0.37  % SZS output start Proof for theBenchmark
% 0.15/0.37  thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.37  thf(func_def_1, type, kpair: $i > $i > $i).
% 0.15/0.37  thf(func_def_2, type, kfst: $i > $i).
% 0.15/0.37  thf(f46,plain,(
% 0.15/0.37    $false),
% 0.15/0.37    inference(subsumption_resolution,[],[f29,f45])).
% 0.15/0.37  thf(f45,plain,(
% 0.15/0.37    ( ! [X2 : $i,X3 : $i] : (((kfst @ (kpair @ X2 @ X3)) = X2)) )),
% 0.15/0.37    inference(trivial_inequality_removal,[],[f40])).
% 0.15/0.37  thf(f40,plain,(
% 0.15/0.37    ( ! [X2 : $i,X3 : $i] : (($true != $true) | ((kfst @ (kpair @ X2 @ X3)) = X2)) )),
% 0.15/0.37    inference(definition_unfolding,[],[f33,f32])).
% 0.15/0.37  thf(f32,plain,(
% 0.15/0.37    (kfstpairEq = $true)),
% 0.15/0.37    inference(cnf_transformation,[],[f18])).
% 0.15/0.37  thf(f18,plain,(
% 0.15/0.37    (kfstpairEq = $true) & (cartprodmempaircEq = $true) & (($true = (in @ sK1 @ sK2)) & ((sK1 != (kfst @ (kpair @ sK1 @ sK3))) & ($true = (in @ sK3 @ sK0))))),
% 0.15/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f15,f17,f16])).
% 0.15/0.37  thf(f16,plain,(
% 0.15/0.37    ? [X0,X1,X2] : (($true = (in @ X1 @ X2)) & ? [X3] : (((kfst @ (kpair @ X1 @ X3)) != X1) & ($true = (in @ X3 @ X0)))) => (($true = (in @ sK1 @ sK2)) & ? [X3] : (((kfst @ (kpair @ sK1 @ X3)) != sK1) & ($true = (in @ X3 @ sK0))))),
% 0.15/0.37    introduced(choice_axiom,[])).
% 0.15/0.37  thf(f17,plain,(
% 0.15/0.37    ? [X3] : (((kfst @ (kpair @ sK1 @ X3)) != sK1) & ($true = (in @ X3 @ sK0))) => ((sK1 != (kfst @ (kpair @ sK1 @ sK3))) & ($true = (in @ sK3 @ sK0)))),
% 0.15/0.37    introduced(choice_axiom,[])).
% 0.15/0.37  thf(f15,plain,(
% 0.15/0.37    (kfstpairEq = $true) & (cartprodmempaircEq = $true) & ? [X0,X1,X2] : (($true = (in @ X1 @ X2)) & ? [X3] : (((kfst @ (kpair @ X1 @ X3)) != X1) & ($true = (in @ X3 @ X0))))),
% 0.15/0.37    inference(rectify,[],[f14])).
% 0.15/0.37  thf(f14,plain,(
% 0.15/0.37    (kfstpairEq = $true) & (cartprodmempaircEq = $true) & ? [X2,X1,X0] : (($true = (in @ X1 @ X0)) & ? [X3] : (((kfst @ (kpair @ X1 @ X3)) != X1) & ($true = (in @ X3 @ X2))))),
% 0.15/0.37    inference(flattening,[],[f13])).
% 0.15/0.37  thf(f13,plain,(
% 0.15/0.37    (? [X2,X1,X0] : (($true = (in @ X1 @ X0)) & ? [X3] : (((kfst @ (kpair @ X1 @ X3)) != X1) & ($true = (in @ X3 @ X2)))) & (cartprodmempaircEq = $true)) & (kfstpairEq = $true)),
% 0.15/0.37    inference(ennf_transformation,[],[f7])).
% 0.15/0.37  thf(f7,plain,(
% 0.15/0.37    ~((kfstpairEq = $true) => ((cartprodmempaircEq = $true) => ! [X2,X0,X1] : (($true = (in @ X1 @ X0)) => ! [X3] : (($true = (in @ X3 @ X2)) => ((kfst @ (kpair @ X1 @ X3)) = X1)))))),
% 0.15/0.37    inference(fool_elimination,[],[f6])).
% 0.15/0.37  thf(f6,plain,(
% 0.15/0.37    ~(kfstpairEq => (cartprodmempaircEq => ! [X0,X1,X2] : ((in @ X1 @ X0) => ! [X3] : ((in @ X3 @ X2) => ((kfst @ (kpair @ X1 @ X3)) = X1)))))),
% 0.15/0.37    inference(rectify,[],[f4])).
% 0.15/0.37  thf(f4,negated_conjecture,(
% 0.15/0.37    ~(kfstpairEq => (cartprodmempaircEq => ! [X2,X0,X3] : ((in @ X0 @ X2) => ! [X1] : ((in @ X1 @ X3) => ((kfst @ (kpair @ X0 @ X1)) = X0)))))),
% 0.15/0.37    inference(negated_conjecture,[],[f3])).
% 0.15/0.37  thf(f3,conjecture,(
% 0.15/0.37    kfstpairEq => (cartprodmempaircEq => ! [X2,X0,X3] : ((in @ X0 @ X2) => ! [X1] : ((in @ X1 @ X3) => ((kfst @ (kpair @ X0 @ X1)) = X0))))),
% 0.15/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodfstpairEq)).
% 0.15/0.37  thf(f33,plain,(
% 0.15/0.37    ( ! [X2 : $i,X3 : $i] : (((kfst @ (kpair @ X2 @ X3)) = X2) | (kfstpairEq != $true)) )),
% 0.15/0.37    inference(cnf_transformation,[],[f22])).
% 0.15/0.37  thf(f22,plain,(
% 0.15/0.37    ((kfstpairEq = $true) | ((kfst @ (kpair @ sK4 @ sK5)) != sK4)) & (! [X2,X3] : ((kfst @ (kpair @ X2 @ X3)) = X2) | (kfstpairEq != $true))),
% 0.15/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f20,f21])).
% 0.15/0.37  thf(f21,plain,(
% 0.15/0.37    ? [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) != X0) => ((kfst @ (kpair @ sK4 @ sK5)) != sK4)),
% 0.15/0.37    introduced(choice_axiom,[])).
% 0.15/0.37  thf(f20,plain,(
% 0.15/0.37    ((kfstpairEq = $true) | ? [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) != X0)) & (! [X2,X3] : ((kfst @ (kpair @ X2 @ X3)) = X2) | (kfstpairEq != $true))),
% 0.15/0.37    inference(rectify,[],[f19])).
% 0.15/0.37  thf(f19,plain,(
% 0.15/0.37    ((kfstpairEq = $true) | ? [X1,X0] : ((kfst @ (kpair @ X1 @ X0)) != X1)) & (! [X1,X0] : ((kfst @ (kpair @ X1 @ X0)) = X1) | (kfstpairEq != $true))),
% 0.15/0.37    inference(nnf_transformation,[],[f11])).
% 0.15/0.37  thf(f11,plain,(
% 0.15/0.37    (kfstpairEq = $true) <=> ! [X1,X0] : ((kfst @ (kpair @ X1 @ X0)) = X1)),
% 0.15/0.37    inference(fool_elimination,[],[f10])).
% 0.15/0.37  thf(f10,plain,(
% 0.15/0.37    (! [X0,X1] : ((kfst @ (kpair @ X1 @ X0)) = X1) = kfstpairEq)),
% 0.15/0.37    inference(rectify,[],[f1])).
% 0.15/0.37  thf(f1,axiom,(
% 0.15/0.37    (! [X1,X0] : ((kfst @ (kpair @ X0 @ X1)) = X0) = kfstpairEq)),
% 0.15/0.37    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq)).
% 0.15/0.37  thf(f29,plain,(
% 0.15/0.37    (sK1 != (kfst @ (kpair @ sK1 @ sK3)))),
% 0.15/0.37    inference(cnf_transformation,[],[f18])).
% 0.15/0.37  % SZS output end Proof for theBenchmark
% 0.15/0.37  % (6618)------------------------------
% 0.15/0.37  % (6618)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37  % (6618)Termination reason: Refutation
% 0.15/0.37  
% 0.15/0.37  % (6618)Memory used [KB]: 5500
% 0.15/0.37  % (6618)Time elapsed: 0.004 s
% 0.15/0.37  % (6618)Instructions burned: 2 (million)
% 0.15/0.37  % (6618)------------------------------
% 0.15/0.37  % (6618)------------------------------
% 0.15/0.37  % (6612)Success in time 0.006 s
% 0.15/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------