TSTP Solution File: SYO114^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO114^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 : 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 09:02:58 EDT 2024
% Result : Theorem 0.14s 0.36s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO114^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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.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 : Mon May 20 10:55:38 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.34 This is a TH0_THM_NEQ_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 % (32251)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.14/0.36 % (32251)First to succeed.
% 0.14/0.36 % (32251)Refutation found. Thanks to Tanya!
% 0.14/0.36 % SZS status Theorem for theBenchmark
% 0.14/0.36 % SZS output start Proof for theBenchmark
% 0.14/0.36 thf(func_def_1, type, cP: $i > $o).
% 0.14/0.36 thf(func_def_4, type, cQ: $i > $o).
% 0.14/0.36 thf(func_def_6, type, cR: $i > $o).
% 0.14/0.36 thf(func_def_10, type, sK0: $i > $i).
% 0.14/0.36 thf(f30,plain,(
% 0.14/0.36 $false),
% 0.14/0.36 inference(avatar_sat_refutation,[],[f21,f27,f29])).
% 0.14/0.36 thf(f29,plain,(
% 0.14/0.36 spl1_2),
% 0.14/0.36 inference(avatar_contradiction_clause,[],[f28])).
% 0.14/0.36 thf(f28,plain,(
% 0.14/0.36 $false | spl1_2),
% 0.14/0.36 inference(subsumption_resolution,[],[f20,f25])).
% 0.14/0.36 thf(f25,plain,(
% 0.14/0.36 ( ! [X1 : $i] : (((cP @ X1) = $true)) )),
% 0.14/0.36 inference(subsumption_resolution,[],[f24,f10])).
% 0.14/0.36 thf(f10,plain,(
% 0.14/0.36 ( ! [X0 : $i] : (((cQ @ X0) = $true)) )),
% 0.14/0.36 inference(cnf_transformation,[],[f8])).
% 0.14/0.36 thf(f8,plain,(
% 0.14/0.36 (((cP @ b) != $true) | ((cP @ a) != $true)) & ! [X0] : ((((cP @ X0) = $true) | ((cR @ X0) = $true)) & ((cQ @ X0) = $true)) & ! [X1] : (((cQ @ d) != $true) | ((cQ @ X1) != $true) | ((cP @ X1) = $true) | ((cQ @ c) != $true) | ($true != (cQ @ (sK0 @ X1))))),
% 0.14/0.36 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 0.14/0.36 thf(f7,plain,(
% 0.14/0.36 ! [X1] : (? [X2] : (((cQ @ d) != $true) | ((cQ @ X1) != $true) | ((cP @ X1) = $true) | ((cQ @ c) != $true) | ((cQ @ X2) != $true)) => (((cQ @ d) != $true) | ((cQ @ X1) != $true) | ((cP @ X1) = $true) | ((cQ @ c) != $true) | ($true != (cQ @ (sK0 @ X1)))))),
% 0.14/0.36 introduced(choice_axiom,[])).
% 0.14/0.36 thf(f6,plain,(
% 0.14/0.36 (((cP @ b) != $true) | ((cP @ a) != $true)) & ! [X0] : ((((cP @ X0) = $true) | ((cR @ X0) = $true)) & ((cQ @ X0) = $true)) & ! [X1] : ? [X2] : (((cQ @ d) != $true) | ((cQ @ X1) != $true) | ((cP @ X1) = $true) | ((cQ @ c) != $true) | ((cQ @ X2) != $true))),
% 0.14/0.36 inference(flattening,[],[f5])).
% 0.14/0.36 thf(f5,plain,(
% 0.14/0.36 ~~(! [X0] : ((((cP @ X0) = $true) | ((cR @ X0) = $true)) & ((cQ @ X0) = $true)) & ! [X1] : ? [X2] : (~((cQ @ d) = $true) | ~((cQ @ X2) = $true) | ((cP @ X1) = $true) | ~((cQ @ X1) = $true) | ~((cQ @ c) = $true)) & (~((cP @ a) = $true) | ~((cP @ b) = $true)))),
% 0.14/0.36 inference(fool_elimination,[],[f4])).
% 0.14/0.36 thf(f4,plain,(
% 0.14/0.36 ~~(! [X0] : (((cP @ X0) | (cR @ X0)) & (cQ @ X0)) & ! [X1] : ? [X2] : (~(cQ @ d) | ~(cQ @ X2) | (cP @ X1) | ~(cQ @ X1) | ~(cQ @ c)) & (~(cP @ a) | ~(cP @ b)))),
% 0.14/0.36 inference(rectify,[],[f2])).
% 0.14/0.36 thf(f2,negated_conjecture,(
% 0.14/0.36 ~~(! [X0] : (((cP @ X0) | (cR @ X0)) & (cQ @ X0)) & ! [X1] : ? [X2] : (~(cQ @ d) | ~(cQ @ X2) | (cP @ X1) | ~(cQ @ X1) | ~(cQ @ c)) & (~(cP @ a) | ~(cP @ b)))),
% 0.14/0.36 inference(negated_conjecture,[],[f1])).
% 0.14/0.36 thf(f1,conjecture,(
% 0.14/0.36 ~(! [X0] : (((cP @ X0) | (cR @ X0)) & (cQ @ X0)) & ! [X1] : ? [X2] : (~(cQ @ d) | ~(cQ @ X2) | (cP @ X1) | ~(cQ @ X1) | ~(cQ @ c)) & (~(cP @ a) | ~(cP @ b)))),
% 0.14/0.36 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM119)).
% 0.14/0.36 thf(f24,plain,(
% 0.14/0.36 ( ! [X1 : $i] : (((cP @ X1) = $true) | ($true != (cQ @ (sK0 @ X1)))) )),
% 0.14/0.36 inference(subsumption_resolution,[],[f23,f10])).
% 0.14/0.36 thf(f23,plain,(
% 0.14/0.36 ( ! [X1 : $i] : (((cQ @ c) != $true) | ($true != (cQ @ (sK0 @ X1))) | ((cP @ X1) = $true)) )),
% 0.14/0.36 inference(subsumption_resolution,[],[f22,f10])).
% 0.14/0.36 thf(f22,plain,(
% 0.14/0.36 ( ! [X1 : $i] : (((cQ @ X1) != $true) | ($true != (cQ @ (sK0 @ X1))) | ((cP @ X1) = $true) | ((cQ @ c) != $true)) )),
% 0.14/0.36 inference(subsumption_resolution,[],[f9,f10])).
% 0.14/0.36 thf(f9,plain,(
% 0.14/0.36 ( ! [X1 : $i] : (((cQ @ d) != $true) | ((cQ @ X1) != $true) | ($true != (cQ @ (sK0 @ X1))) | ((cP @ X1) = $true) | ((cQ @ c) != $true)) )),
% 0.14/0.36 inference(cnf_transformation,[],[f8])).
% 0.14/0.36 thf(f20,plain,(
% 0.14/0.36 ((cP @ a) != $true) | spl1_2),
% 0.14/0.36 inference(avatar_component_clause,[],[f18])).
% 0.14/0.36 thf(f18,plain,(
% 0.14/0.36 spl1_2 <=> ((cP @ a) = $true)),
% 0.14/0.36 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.14/0.36 thf(f27,plain,(
% 0.14/0.36 spl1_1),
% 0.14/0.36 inference(avatar_contradiction_clause,[],[f26])).
% 0.14/0.36 thf(f26,plain,(
% 0.14/0.36 $false | spl1_1),
% 0.14/0.36 inference(subsumption_resolution,[],[f16,f25])).
% 0.14/0.36 thf(f16,plain,(
% 0.14/0.36 ((cP @ b) != $true) | spl1_1),
% 0.14/0.36 inference(avatar_component_clause,[],[f14])).
% 0.14/0.36 thf(f14,plain,(
% 0.14/0.36 spl1_1 <=> ((cP @ b) = $true)),
% 0.14/0.36 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.14/0.36 thf(f21,plain,(
% 0.14/0.36 ~spl1_1 | ~spl1_2),
% 0.14/0.36 inference(avatar_split_clause,[],[f12,f18,f14])).
% 0.14/0.36 thf(f12,plain,(
% 0.14/0.36 ((cP @ b) != $true) | ((cP @ a) != $true)),
% 0.14/0.36 inference(cnf_transformation,[],[f8])).
% 0.14/0.36 % SZS output end Proof for theBenchmark
% 0.14/0.36 % (32251)------------------------------
% 0.14/0.36 % (32251)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.36 % (32251)Termination reason: Refutation
% 0.14/0.36
% 0.14/0.36 % (32251)Memory used [KB]: 5500
% 0.14/0.36 % (32251)Time elapsed: 0.003 s
% 0.14/0.36 % (32251)Instructions burned: 2 (million)
% 0.14/0.36 % (32251)------------------------------
% 0.14/0.36 % (32251)------------------------------
% 0.14/0.36 % (32241)Success in time 0.012 s
% 0.14/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------