TSTP Solution File: SEU925^5 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU925^5 : TPTP v8.2.0. Released v4.0.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 : n028.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:52:13 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem    : SEU925^5 : TPTP v8.2.0. Released v4.0.0.
% 0.04/0.13  % 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.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 16:22:22 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a TH0_THM_EQU_NAR problem
% 0.13/0.34  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.19/0.36  % (15934)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.19/0.36  % (15931)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.19/0.36  % (15934)First to succeed.
% 0.19/0.37  % (15931)Also succeeded, but the first one will report.
% 0.19/0.37  % (15934)Refutation found. Thanks to Tanya!
% 0.19/0.37  % SZS status Theorem for theBenchmark
% 0.19/0.37  % SZS output start Proof for theBenchmark
% 0.19/0.37  thf(func_def_9, type, ph3: !>[X0: $tType]:(X0)).
% 0.19/0.37  thf(f20,plain,(
% 0.19/0.37    $false),
% 0.19/0.37    inference(subsumption_resolution,[],[f19,f9])).
% 0.19/0.37  thf(f9,plain,(
% 0.19/0.37    (sK0 != sK1)),
% 0.19/0.37    inference(cnf_transformation,[],[f8])).
% 0.19/0.37  thf(f8,plain,(
% 0.19/0.37    ((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0))) & (sK0 != sK1)),
% 0.19/0.37    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f7])).
% 0.19/0.37  thf(f7,plain,(
% 0.19/0.37    ? [X0,X1] : (((^[Y0 : $i]: (X1 = Y0)) = (^[Y0 : $i]: (X0 = Y0))) & (X0 != X1)) => (((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0))) & (sK0 != sK1))),
% 0.19/0.37    introduced(choice_axiom,[])).
% 0.19/0.37  thf(f6,plain,(
% 0.19/0.37    ? [X0,X1] : (((^[Y0 : $i]: (X1 = Y0)) = (^[Y0 : $i]: (X0 = Y0))) & (X0 != X1))),
% 0.19/0.37    inference(ennf_transformation,[],[f5])).
% 0.19/0.37  thf(f5,plain,(
% 0.19/0.37    ~! [X0,X1] : (((^[Y0 : $i]: (X1 = Y0)) = (^[Y0 : $i]: (X0 = Y0))) => (X0 = X1))),
% 0.19/0.37    inference(fool_elimination,[],[f4])).
% 0.19/0.37  thf(f4,plain,(
% 0.19/0.37    ~! [X0,X1] : (((^[X2 : $i] : ((X0 = X2))) = (^[X3 : $i] : ((X1 = X3)))) => (X0 = X1))),
% 0.19/0.37    inference(rectify,[],[f2])).
% 0.19/0.37  thf(f2,negated_conjecture,(
% 0.19/0.37    ~! [X1,X0] : (((^[X3 : $i] : ((X1 = X3))) = (^[X2 : $i] : ((X0 = X2)))) => (X0 = X1))),
% 0.19/0.37    inference(negated_conjecture,[],[f1])).
% 0.19/0.37  thf(f1,conjecture,(
% 0.19/0.37    ! [X1,X0] : (((^[X3 : $i] : ((X1 = X3))) = (^[X2 : $i] : ((X0 = X2)))) => (X0 = X1))),
% 0.19/0.37    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM7_TPS2_pme)).
% 0.19/0.37  thf(f19,plain,(
% 0.19/0.37    (sK0 = sK1)),
% 0.19/0.37    inference(equality_resolution,[],[f16])).
% 0.19/0.37  thf(f16,plain,(
% 0.19/0.37    ( ! [X1 : $i] : ((sK0 != X1) | (sK1 = X1)) )),
% 0.19/0.37    inference(equality_proxy_clausification,[],[f15])).
% 0.19/0.37  thf(f15,plain,(
% 0.19/0.37    ( ! [X1 : $i] : (($true = (sK1 = X1)) | (sK0 != X1)) )),
% 0.19/0.37    inference(equality_proxy_clausification,[],[f14])).
% 0.19/0.37  thf(f14,plain,(
% 0.19/0.37    ( ! [X1 : $i] : (($false = (sK0 = X1)) | ($true = (sK1 = X1))) )),
% 0.19/0.37    inference(binary_proxy_clausification,[],[f12])).
% 0.19/0.37  thf(f12,plain,(
% 0.19/0.37    ( ! [X1 : $i] : (((sK0 = X1) = (sK1 = X1))) )),
% 0.19/0.37    inference(argument_congruence,[],[f11])).
% 0.19/0.37  thf(f11,plain,(
% 0.19/0.37    ((= @ sK0) = (= @ sK1))),
% 0.19/0.37    inference(beta_eta_normalization,[],[f10])).
% 0.19/0.37  thf(f10,plain,(
% 0.19/0.37    ((^[Y0 : $i]: (sK1 = Y0)) = (^[Y0 : $i]: (sK0 = Y0)))),
% 0.19/0.37    inference(cnf_transformation,[],[f8])).
% 0.19/0.37  % SZS output end Proof for theBenchmark
% 0.19/0.37  % (15934)------------------------------
% 0.19/0.37  % (15934)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.37  % (15934)Termination reason: Refutation
% 0.19/0.37  
% 0.19/0.37  % (15934)Memory used [KB]: 5500
% 0.19/0.37  % (15934)Time elapsed: 0.003 s
% 0.19/0.37  % (15934)Instructions burned: 1 (million)
% 0.19/0.37  % (15934)------------------------------
% 0.19/0.37  % (15934)------------------------------
% 0.19/0.37  % (15927)Success in time 0.017 s
% 0.19/0.37  % Vampire---4.8 exiting
%------------------------------------------------------------------------------