TSTP Solution File: SYO101^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO101^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 : n018.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:56 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.06/0.12 % Problem : SYO101^5 : TPTP v8.2.0. Released v4.0.0.
% 0.06/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 : n018.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:39:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 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 % (12479)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.14/0.36 % (12480)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.14/0.37 % (12479)First to succeed.
% 0.14/0.37 % (12480)Also succeeded, but the first one will report.
% 0.14/0.37 % (12479)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_1, type, cR: $i > $i > $o).
% 0.14/0.37 thf(func_def_2, type, cP: $i > $o).
% 0.14/0.37 thf(func_def_4, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.14/0.37 thf(func_def_7, type, sK0: $i > $i).
% 0.14/0.37 thf(func_def_8, type, sK1: $i > $i).
% 0.14/0.37 thf(f29,plain,(
% 0.14/0.37 $false),
% 0.14/0.37 inference(avatar_sat_refutation,[],[f20,f25,f28])).
% 0.14/0.37 thf(f28,plain,(
% 0.14/0.37 ~spl2_1),
% 0.14/0.37 inference(avatar_contradiction_clause,[],[f27])).
% 0.14/0.37 thf(f27,plain,(
% 0.14/0.37 $false | ~spl2_1),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f26])).
% 0.14/0.37 thf(f26,plain,(
% 0.14/0.37 ($true != $true) | ~spl2_1),
% 0.14/0.37 inference(superposition,[],[f16,f10])).
% 0.14/0.37 thf(f10,plain,(
% 0.14/0.37 ( ! [X3 : $i] : (((cP @ (sK1 @ X3)) = $true)) )),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 thf(f9,plain,(
% 0.14/0.37 ! [X0] : (! [X2] : (((cP @ X2) = $true) & ($true = (cR @ X0 @ (sK0 @ X0)))) | ((cP @ X0) != $true)) & ! [X3] : (((cR @ cW @ X3) != $true) & ((cP @ (sK1 @ X3)) = $true))),
% 0.14/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 0.14/0.37 thf(f7,plain,(
% 0.14/0.37 ! [X0] : (? [X1] : (! [X2] : (((cP @ X2) = $true) & ((cR @ X0 @ X1) = $true)) | ((cP @ X0) != $true)) => (! [X2] : (((cP @ X2) = $true) & ($true = (cR @ X0 @ (sK0 @ X0)))) | ((cP @ X0) != $true)))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f8,plain,(
% 0.14/0.37 ! [X3] : (? [X4] : (((cR @ cW @ X3) != $true) & ((cP @ X4) = $true)) => (((cR @ cW @ X3) != $true) & ((cP @ (sK1 @ X3)) = $true)))),
% 0.14/0.37 introduced(choice_axiom,[])).
% 0.14/0.37 thf(f6,plain,(
% 0.14/0.37 ! [X0] : ? [X1] : (! [X2] : (((cP @ X2) = $true) & ((cR @ X0 @ X1) = $true)) | ((cP @ X0) != $true)) & ! [X3] : ? [X4] : (((cR @ cW @ X3) != $true) & ((cP @ X4) = $true))),
% 0.14/0.37 inference(ennf_transformation,[],[f5])).
% 0.14/0.37 thf(f5,plain,(
% 0.14/0.37 ~(! [X0] : ? [X1] : (((cP @ X0) = $true) => ! [X2] : (((cP @ X2) = $true) & ((cR @ X0 @ X1) = $true))) => ? [X3] : ! [X4] : (((cP @ X4) = $true) => ((cR @ cW @ X3) = $true)))),
% 0.14/0.37 inference(fool_elimination,[],[f4])).
% 0.14/0.37 thf(f4,plain,(
% 0.14/0.37 ~(! [X0] : ? [X1] : ((cP @ X0) => ! [X2] : ((cR @ X0 @ X1) & (cP @ X2))) => ? [X3] : ! [X4] : ((cP @ X4) => (cR @ cW @ X3)))),
% 0.14/0.37 inference(rectify,[],[f2])).
% 0.14/0.37 thf(f2,negated_conjecture,(
% 0.14/0.37 ~(! [X0] : ? [X1] : ((cP @ X0) => ! [X2] : ((cR @ X0 @ X1) & (cP @ X2))) => ? [X3] : ! [X4] : ((cP @ X4) => (cR @ cW @ X3)))),
% 0.14/0.37 inference(negated_conjecture,[],[f1])).
% 0.14/0.37 thf(f1,conjecture,(
% 0.14/0.37 ! [X0] : ? [X1] : ((cP @ X0) => ! [X2] : ((cR @ X0 @ X1) & (cP @ X2))) => ? [X3] : ! [X4] : ((cP @ X4) => (cR @ cW @ X3))),
% 0.14/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM83)).
% 0.14/0.37 thf(f16,plain,(
% 0.14/0.37 ( ! [X0 : $i] : (((cP @ X0) != $true)) ) | ~spl2_1),
% 0.14/0.37 inference(avatar_component_clause,[],[f15])).
% 0.14/0.37 thf(f15,plain,(
% 0.14/0.37 spl2_1 <=> ! [X0] : ((cP @ X0) != $true)),
% 0.14/0.37 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.14/0.37 thf(f25,plain,(
% 0.14/0.37 ~spl2_2),
% 0.14/0.37 inference(avatar_contradiction_clause,[],[f24])).
% 0.14/0.37 thf(f24,plain,(
% 0.14/0.37 $false | ~spl2_2),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f23])).
% 0.14/0.37 thf(f23,plain,(
% 0.14/0.37 ($true != $true) | ~spl2_2),
% 0.14/0.37 inference(superposition,[],[f11,f22])).
% 0.14/0.37 thf(f22,plain,(
% 0.14/0.37 ( ! [X0 : $i] : (($true = (cR @ X0 @ (sK0 @ X0)))) ) | ~spl2_2),
% 0.14/0.37 inference(trivial_inequality_removal,[],[f21])).
% 0.14/0.37 thf(f21,plain,(
% 0.14/0.37 ( ! [X0 : $i] : (($true != $true) | ($true = (cR @ X0 @ (sK0 @ X0)))) ) | ~spl2_2),
% 0.14/0.37 inference(forward_demodulation,[],[f12,f19])).
% 0.14/0.37 thf(f19,plain,(
% 0.14/0.37 ( ! [X2 : $i] : (((cP @ X2) = $true)) ) | ~spl2_2),
% 0.14/0.37 inference(avatar_component_clause,[],[f18])).
% 0.14/0.37 thf(f18,plain,(
% 0.14/0.37 spl2_2 <=> ! [X2] : ((cP @ X2) = $true)),
% 0.14/0.37 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.14/0.37 thf(f12,plain,(
% 0.14/0.37 ( ! [X0 : $i] : (($true = (cR @ X0 @ (sK0 @ X0))) | ((cP @ X0) != $true)) )),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 thf(f11,plain,(
% 0.14/0.37 ( ! [X3 : $i] : (((cR @ cW @ X3) != $true)) )),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 thf(f20,plain,(
% 0.14/0.37 spl2_1 | spl2_2),
% 0.14/0.37 inference(avatar_split_clause,[],[f13,f18,f15])).
% 0.14/0.37 thf(f13,plain,(
% 0.14/0.37 ( ! [X2 : $i,X0 : $i] : (((cP @ X0) != $true) | ((cP @ X2) = $true)) )),
% 0.14/0.37 inference(cnf_transformation,[],[f9])).
% 0.14/0.37 % SZS output end Proof for theBenchmark
% 0.14/0.37 % (12479)------------------------------
% 0.14/0.37 % (12479)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (12479)Termination reason: Refutation
% 0.14/0.37
% 0.14/0.37 % (12479)Memory used [KB]: 5500
% 0.14/0.37 % (12479)Time elapsed: 0.003 s
% 0.14/0.37 % (12479)Instructions burned: 1 (million)
% 0.14/0.37 % (12479)------------------------------
% 0.14/0.37 % (12479)------------------------------
% 0.14/0.37 % (12476)Success in time 0.003 s
% 0.14/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------