TSTP Solution File: SYO214^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO214^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 : 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 09:03:32 EDT 2024
% Result : Theorem 0.14s 0.37s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO214^5 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.14 % 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.14/0.35 % Computer : n016.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 20 10:31:53 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.36 % (14772)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (14772)First to succeed.
% 0.14/0.37 % (14772)Refutation found. Thanks to Tanya!
% 0.14/0.37 % SZS status Theorem for theBenchmark
% 0.14/0.37 % SZS output start Proof for theBenchmark
% 0.14/0.37 thf(func_def_3, type, sK0: $i > $o).
% 0.14/0.37 thf(func_def_4, type, sK1: $i > $o).
% 0.14/0.37 thf(f14,plain,(
% 0.14/0.37 $false),
% 0.14/0.37 inference(subsumption_resolution,[],[f12,f13])).
% 0.14/0.37 thf(f13,plain,(
% 0.14/0.37 ((sK1 @ sK2) != $true)),
% 0.14/0.37 inference(definition_unfolding,[],[f11,f10])).
% 0.14/0.37 thf(f10,plain,(
% 0.14/0.37 (sK0 = sK1)),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 thf(f9,plain,(
% 0.14/0.37 (((sK1 @ sK2) = $true) & ((sK0 @ sK2) != $true)) & (sK0 = sK1)),
% 0.14/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f6,f8,f7])).
% 0.14/0.37 thf(f7,plain,(
% 0.14/0.37 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : (((X1 @ X2) = $true) & ((X0 @ X2) != $true)) & (X0 = X1)) => (? [X2] : (((sK1 @ X2) = $true) & ((sK0 @ X2) != $true)) & (sK0 = sK1))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f8,plain,(
% 0.14/0.37 ? [X2] : (((sK1 @ X2) = $true) & ((sK0 @ X2) != $true)) => (((sK1 @ sK2) = $true) & ((sK0 @ sK2) != $true))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f6,plain,(
% 0.14/0.37 ? [X0 : $i > $o,X1 : $i > $o] : (? [X2] : (((X1 @ X2) = $true) & ((X0 @ X2) != $true)) & (X0 = X1))),
% 0.14/0.37 inference(ennf_transformation,[],[f5])).
% 0.14/0.37 thf(f5,plain,(
% 0.14/0.37 ~! [X1 : $i > $o,X0 : $i > $o] : ((X0 = X1) => ! [X2] : (((X1 @ X2) = $true) => ((X0 @ X2) = $true)))),
% 0.14/0.37 inference(fool_elimination,[],[f4])).
% 0.14/0.37 thf(f4,plain,(
% 0.14/0.37 ~! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : ((X1 @ X2) => (X0 @ X2)))),
% 0.14/0.37 inference(rectify,[],[f2])).
% 0.14/0.37 thf(f2,negated_conjecture,(
% 0.14/0.37 ~! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : ((X1 @ X2) => (X0 @ X2)))),
% 0.14/0.37 inference(negated_conjecture,[],[f1])).
% 0.14/0.37 thf(f1,conjecture,(
% 0.14/0.37 ! [X0 : $i > $o,X1 : $i > $o] : ((X0 = X1) => ! [X2] : ((X1 @ X2) => (X0 @ X2)))),
% 0.14/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM12)).
% 0.14/0.37 thf(f11,plain,(
% 0.14/0.37 ((sK0 @ sK2) != $true)),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 thf(f12,plain,(
% 0.14/0.37 ((sK1 @ sK2) = $true)),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 % SZS output end Proof for theBenchmark
% 0.14/0.37 % (14772)------------------------------
% 0.14/0.37 % (14772)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (14772)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (14772)Memory used [KB]: 5373
% 0.14/0.37 % (14772)Time elapsed: 0.002 s
% 0.14/0.37 % (14772)Instructions burned: 1 (million)
% 0.14/0.37 % (14772)------------------------------
% 0.14/0.37 % (14772)------------------------------
% 0.14/0.37 % (14766)Success in time 0.002 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------