TSTP Solution File: SEU568^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU568^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 : n009.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:49:38 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU568^2 : TPTP v8.2.0. Released v3.7.0.
% 0.06/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.13/0.34 % Computer : n009.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:50:08 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/sandbox/benchmark/theBenchmark.p
% 0.13/0.35 % (16377)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 (3000ds/275Mi)
% 0.13/0.36 % (16377)First to succeed.
% 0.13/0.36 % (16377)Refutation found. Thanks to Tanya!
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% 0.13/0.36 thf(func_def_0, type, in: $i > $i > $o).
% 0.13/0.36 thf(func_def_1, type, subset: $i > $i > $o).
% 0.13/0.36 thf(f54,plain,(
% 0.13/0.36 $false),
% 0.13/0.36 inference(subsumption_resolution,[],[f35,f46])).
% 0.13/0.36 thf(f46,plain,(
% 0.13/0.36 ($true != (in @ sK3 @ sK2))),
% 0.13/0.36 inference(definition_unfolding,[],[f36,f37])).
% 0.13/0.36 thf(f37,plain,(
% 0.13/0.36 (sK4 = sK2)),
% 0.13/0.36 inference(cnf_transformation,[],[f26])).
% 0.13/0.36 thf(f26,plain,(
% 0.13/0.36 (notsubsetI = $true) & ((sK4 = sK2) & ((in @ sK3 @ sK4) != $true) & ($true = (in @ sK3 @ sK2))) & (notequalI1 = $true)),
% 0.13/0.36 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f24,f25])).
% 0.13/0.36 thf(f25,plain,(
% 0.13/0.36 ? [X0,X1,X2] : ((X0 = X2) & ((in @ X1 @ X2) != $true) & ((in @ X1 @ X0) = $true)) => ((sK4 = sK2) & ((in @ sK3 @ sK4) != $true) & ($true = (in @ sK3 @ sK2)))),
% 0.13/0.36 introduced(choice_axiom,[])).
% 0.13/0.36 thf(f24,plain,(
% 0.13/0.36 (notsubsetI = $true) & ? [X0,X1,X2] : ((X0 = X2) & ((in @ X1 @ X2) != $true) & ((in @ X1 @ X0) = $true)) & (notequalI1 = $true)),
% 0.13/0.36 inference(rectify,[],[f18])).
% 0.13/0.36 thf(f18,plain,(
% 0.13/0.36 (notsubsetI = $true) & ? [X1,X2,X0] : ((X0 = X1) & ((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true)) & (notequalI1 = $true)),
% 0.13/0.36 inference(flattening,[],[f17])).
% 0.13/0.36 thf(f17,plain,(
% 0.13/0.36 (? [X1,X2,X0] : (((X0 = X1) & ((in @ X2 @ X0) != $true)) & ((in @ X2 @ X1) = $true)) & (notequalI1 = $true)) & (notsubsetI = $true)),
% 0.13/0.36 inference(ennf_transformation,[],[f12])).
% 0.13/0.36 thf(f12,plain,(
% 0.13/0.36 ~((notsubsetI = $true) => ((notequalI1 = $true) => ! [X1,X2,X0] : (((in @ X2 @ X1) = $true) => (((in @ X2 @ X0) != $true) => (X0 != X1)))))),
% 0.13/0.36 inference(flattening,[],[f7])).
% 0.13/0.36 thf(f7,plain,(
% 0.13/0.36 ~((notsubsetI = $true) => ((notequalI1 = $true) => ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) => (~((in @ X2 @ X0) = $true) => (X0 != X1)))))),
% 0.13/0.36 inference(fool_elimination,[],[f6])).
% 0.13/0.36 thf(f6,plain,(
% 0.13/0.36 ~(notsubsetI => (notequalI1 => ! [X0,X1,X2] : ((in @ X2 @ X1) => (~(in @ X2 @ X0) => (X0 != X1)))))),
% 0.13/0.36 inference(rectify,[],[f4])).
% 0.13/0.36 thf(f4,negated_conjecture,(
% 0.13/0.36 ~(notsubsetI => (notequalI1 => ! [X1,X0,X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X1) => (X0 != X1)))))),
% 0.13/0.36 inference(negated_conjecture,[],[f3])).
% 0.13/0.36 thf(f3,conjecture,(
% 0.13/0.36 notsubsetI => (notequalI1 => ! [X1,X0,X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X1) => (X0 != X1))))),
% 0.13/0.36 file('/export/starexec/sandbox/benchmark/theBenchmark.p',notequalI2)).
% 0.13/0.36 thf(f36,plain,(
% 0.13/0.36 ((in @ sK3 @ sK4) != $true)),
% 0.13/0.36 inference(cnf_transformation,[],[f26])).
% 0.13/0.36 thf(f35,plain,(
% 0.13/0.36 ($true = (in @ sK3 @ sK2))),
% 0.13/0.36 inference(cnf_transformation,[],[f26])).
% 0.13/0.36 % SZS output end Proof for theBenchmark
% 0.13/0.36 % (16377)------------------------------
% 0.13/0.36 % (16377)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (16377)Termination reason: Refutation
% 0.13/0.36
% 0.13/0.36 % (16377)Memory used [KB]: 5500
% 0.13/0.36 % (16377)Time elapsed: 0.002 s
% 0.13/0.36 % (16377)Instructions burned: 2 (million)
% 0.13/0.36 % (16377)------------------------------
% 0.13/0.36 % (16377)------------------------------
% 0.13/0.36 % (16371)Success in time 0.001 s
% 0.13/0.36 % Vampire---4.8 exiting
%------------------------------------------------------------------------------