TSTP Solution File: SEU728^2 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SEU728^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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n010.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:51:04 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SEU728^2 : TPTP v8.2.0. Released v3.7.0.
% 0.03/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 : n010.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 17:16:38 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.37  % (4671)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.19/0.37  % (4676)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 (2999ds/275Mi)
% 0.19/0.37  % (4676)First to succeed.
% 0.19/0.37  % (4673)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 (2999ds/27Mi)
% 0.19/0.38  % (4678)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.19/0.38  % (4676)Refutation found. Thanks to Tanya!
% 0.19/0.38  % SZS status Theorem for theBenchmark
% 0.19/0.38  % SZS output start Proof for theBenchmark
% 0.19/0.38  thf(func_def_0, type, in: $i > $i > $o).
% 0.19/0.38  thf(func_def_1, type, powerset: $i > $i).
% 0.19/0.38  thf(func_def_2, type, setminus: $i > $i > $i).
% 0.19/0.38  thf(f58,plain,(
% 0.19/0.38    $false),
% 0.19/0.38    inference(subsumption_resolution,[],[f57,f38])).
% 0.19/0.38  thf(f38,plain,(
% 0.19/0.38    ((in @ sK5 @ sK3) != $true)),
% 0.19/0.38    inference(cnf_transformation,[],[f25])).
% 0.19/0.38  thf(f25,plain,(
% 0.19/0.38    (setminusI = $true) & ((((in @ sK5 @ sK3) != $true) & ($true = (in @ sK5 @ sK4)) & ((in @ sK5 @ (setminus @ sK4 @ (setminus @ sK4 @ sK3))) = $true)) & ((in @ sK3 @ (powerset @ sK4)) = $true)) & (setminusER = $true)),
% 0.19/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f16,f24,f23])).
% 0.19/0.38  thf(f23,plain,(
% 0.19/0.38    ? [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ (setminus @ X1 @ (setminus @ X1 @ X0))) = $true)) & ($true = (in @ X0 @ (powerset @ X1)))) => (? [X2] : (($true != (in @ X2 @ sK3)) & ((in @ X2 @ sK4) = $true) & ((in @ X2 @ (setminus @ sK4 @ (setminus @ sK4 @ sK3))) = $true)) & ((in @ sK3 @ (powerset @ sK4)) = $true))),
% 0.19/0.38    introduced(choice_axiom,[])).
% 0.19/0.38  thf(f24,plain,(
% 0.19/0.38    ? [X2] : (($true != (in @ X2 @ sK3)) & ((in @ X2 @ sK4) = $true) & ((in @ X2 @ (setminus @ sK4 @ (setminus @ sK4 @ sK3))) = $true)) => (((in @ sK5 @ sK3) != $true) & ($true = (in @ sK5 @ sK4)) & ((in @ sK5 @ (setminus @ sK4 @ (setminus @ sK4 @ sK3))) = $true))),
% 0.19/0.38    introduced(choice_axiom,[])).
% 0.19/0.38  thf(f16,plain,(
% 0.19/0.38    (setminusI = $true) & ? [X0,X1] : (? [X2] : (((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ (setminus @ X1 @ (setminus @ X1 @ X0))) = $true)) & ($true = (in @ X0 @ (powerset @ X1)))) & (setminusER = $true)),
% 0.19/0.38    inference(flattening,[],[f15])).
% 0.19/0.38  thf(f15,plain,(
% 0.19/0.38    (? [X0,X1] : (? [X2] : ((((in @ X2 @ X0) != $true) & ((in @ X2 @ (setminus @ X1 @ (setminus @ X1 @ X0))) = $true)) & ((in @ X2 @ X1) = $true)) & ($true = (in @ X0 @ (powerset @ X1)))) & (setminusER = $true)) & (setminusI = $true)),
% 0.19/0.38    inference(ennf_transformation,[],[f9])).
% 0.19/0.38  thf(f9,plain,(
% 0.19/0.38    ~((setminusI = $true) => ((setminusER = $true) => ! [X0,X1] : (($true = (in @ X0 @ (powerset @ X1))) => ! [X2] : (((in @ X2 @ X1) = $true) => (((in @ X2 @ (setminus @ X1 @ (setminus @ X1 @ X0))) = $true) => ((in @ X2 @ X0) = $true))))))),
% 0.19/0.38    inference(fool_elimination,[],[f8])).
% 0.19/0.38  thf(f8,plain,(
% 0.19/0.38    ~(setminusI => (setminusER => ! [X0,X1] : ((in @ X0 @ (powerset @ X1)) => ! [X2] : ((in @ X2 @ X1) => ((in @ X2 @ (setminus @ X1 @ (setminus @ X1 @ X0))) => (in @ X2 @ X0))))))),
% 0.19/0.38    inference(rectify,[],[f4])).
% 0.19/0.38  thf(f4,negated_conjecture,(
% 0.19/0.38    ~(setminusI => (setminusER => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X3))) => (in @ X2 @ X3))))))),
% 0.19/0.38    inference(negated_conjecture,[],[f3])).
% 0.19/0.38  thf(f3,conjecture,(
% 0.19/0.38    setminusI => (setminusER => ! [X3,X0] : ((in @ X3 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ X0) => ((in @ X2 @ (setminus @ X0 @ (setminus @ X0 @ X3))) => (in @ X2 @ X3)))))),
% 0.19/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',doubleComplementE1)).
% 0.19/0.38  thf(f57,plain,(
% 0.19/0.38    ((in @ sK5 @ sK3) = $true)),
% 0.19/0.38    inference(subsumption_resolution,[],[f56,f37])).
% 0.19/0.38  thf(f37,plain,(
% 0.19/0.38    ($true = (in @ sK5 @ sK4))),
% 0.19/0.38    inference(cnf_transformation,[],[f25])).
% 0.19/0.38  thf(f56,plain,(
% 0.19/0.38    ($true != (in @ sK5 @ sK4)) | ((in @ sK5 @ sK3) = $true)),
% 0.19/0.38    inference(trivial_inequality_removal,[],[f55])).
% 0.19/0.38  thf(f55,plain,(
% 0.19/0.38    ((in @ sK5 @ sK3) = $true) | ($true != (in @ sK5 @ sK4)) | ($true != $true)),
% 0.19/0.38    inference(superposition,[],[f53,f51])).
% 0.19/0.38  thf(f51,plain,(
% 0.19/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) )),
% 0.19/0.38    inference(trivial_inequality_removal,[],[f43])).
% 0.19/0.38  thf(f43,plain,(
% 0.19/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ($true != $true)) )),
% 0.19/0.38    inference(definition_unfolding,[],[f33,f39])).
% 0.19/0.38  thf(f39,plain,(
% 0.19/0.38    (setminusI = $true)),
% 0.19/0.38    inference(cnf_transformation,[],[f25])).
% 0.19/0.38  thf(f33,plain,(
% 0.19/0.38    ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true) | (setminusI != $true)) )),
% 0.19/0.38    inference(cnf_transformation,[],[f22])).
% 0.19/0.38  thf(f22,plain,(
% 0.19/0.38    (! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) | (setminusI != $true)) & ((setminusI = $true) | (($true = (in @ sK2 @ sK1)) & ((in @ sK2 @ (setminus @ sK1 @ sK0)) != $true) & ((in @ sK2 @ sK0) != $true)))),
% 0.19/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f20,f21])).
% 0.19/0.38  thf(f21,plain,(
% 0.19/0.38    ? [X3,X4,X5] : (((in @ X5 @ X4) = $true) & ($true != (in @ X5 @ (setminus @ X4 @ X3))) & ((in @ X5 @ X3) != $true)) => (($true = (in @ sK2 @ sK1)) & ((in @ sK2 @ (setminus @ sK1 @ sK0)) != $true) & ((in @ sK2 @ sK0) != $true))),
% 0.19/0.38    introduced(choice_axiom,[])).
% 0.19/0.38  thf(f20,plain,(
% 0.19/0.38    (! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) | (setminusI != $true)) & ((setminusI = $true) | ? [X3,X4,X5] : (((in @ X5 @ X4) = $true) & ($true != (in @ X5 @ (setminus @ X4 @ X3))) & ((in @ X5 @ X3) != $true)))),
% 0.19/0.38    inference(rectify,[],[f19])).
% 0.19/0.38  thf(f19,plain,(
% 0.19/0.38    (! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) | (setminusI != $true)) & ((setminusI = $true) | ? [X0,X1,X2] : (((in @ X2 @ X1) = $true) & ((in @ X2 @ (setminus @ X1 @ X0)) != $true) & ((in @ X2 @ X0) != $true)))),
% 0.19/0.38    inference(nnf_transformation,[],[f18])).
% 0.19/0.38  thf(f18,plain,(
% 0.19/0.38    ! [X0,X1,X2] : (((in @ X2 @ X1) != $true) | ((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) <=> (setminusI = $true)),
% 0.19/0.38    inference(flattening,[],[f17])).
% 0.19/0.38  thf(f17,plain,(
% 0.19/0.38    ! [X0,X1,X2] : ((((in @ X2 @ (setminus @ X1 @ X0)) = $true) | ((in @ X2 @ X0) = $true)) | ((in @ X2 @ X1) != $true)) <=> (setminusI = $true)),
% 0.19/0.38    inference(ennf_transformation,[],[f12])).
% 0.19/0.38  thf(f12,plain,(
% 0.19/0.38    ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) => (((in @ X2 @ X0) != $true) => ((in @ X2 @ (setminus @ X1 @ X0)) = $true))) <=> (setminusI = $true)),
% 0.19/0.38    inference(flattening,[],[f11])).
% 0.19/0.38  thf(f11,plain,(
% 0.19/0.38    ! [X0,X1,X2] : (((in @ X2 @ X1) = $true) => (~((in @ X2 @ X0) = $true) => ((in @ X2 @ (setminus @ X1 @ X0)) = $true))) <=> (setminusI = $true)),
% 0.19/0.38    inference(fool_elimination,[],[f10])).
% 0.19/0.38  thf(f10,plain,(
% 0.19/0.38    (! [X0,X1,X2] : ((in @ X2 @ X1) => (~(in @ X2 @ X0) => (in @ X2 @ (setminus @ X1 @ X0)))) = setminusI)),
% 0.19/0.38    inference(rectify,[],[f1])).
% 0.19/0.38  thf(f1,axiom,(
% 0.19/0.38    (! [X1,X0,X2] : ((in @ X2 @ X0) => (~(in @ X2 @ X1) => (in @ X2 @ (setminus @ X0 @ X1)))) = setminusI)),
% 0.19/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusI)).
% 0.19/0.38  thf(f53,plain,(
% 0.19/0.38    ($true != (in @ sK5 @ (setminus @ sK4 @ sK3)))),
% 0.19/0.38    inference(trivial_inequality_removal,[],[f52])).
% 0.19/0.38  thf(f52,plain,(
% 0.19/0.38    ($true != (in @ sK5 @ (setminus @ sK4 @ sK3))) | ($true != $true)),
% 0.19/0.38    inference(superposition,[],[f50,f36])).
% 0.19/0.38  thf(f36,plain,(
% 0.19/0.38    ((in @ sK5 @ (setminus @ sK4 @ (setminus @ sK4 @ sK3))) = $true)),
% 0.19/0.38    inference(cnf_transformation,[],[f25])).
% 0.19/0.38  thf(f50,plain,(
% 0.19/0.38    ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (setminus @ X4 @ X3))) | ((in @ X5 @ X3) != $true)) )),
% 0.19/0.38    inference(trivial_inequality_removal,[],[f49])).
% 0.19/0.38  thf(f49,plain,(
% 0.19/0.38    ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X5 @ X3) != $true) | ($true != (in @ X5 @ (setminus @ X4 @ X3)))) )),
% 0.19/0.38    inference(definition_unfolding,[],[f40,f34])).
% 0.19/0.38  thf(f34,plain,(
% 0.19/0.38    (setminusER = $true)),
% 0.19/0.38    inference(cnf_transformation,[],[f25])).
% 0.19/0.38  thf(f40,plain,(
% 0.19/0.38    ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (in @ X5 @ (setminus @ X4 @ X3))) | ((in @ X5 @ X3) != $true) | (setminusER != $true)) )),
% 0.19/0.38    inference(cnf_transformation,[],[f29])).
% 0.19/0.38  thf(f29,plain,(
% 0.19/0.38    ((setminusER = $true) | (($true = (in @ sK8 @ (setminus @ sK7 @ sK6))) & ($true = (in @ sK8 @ sK6)))) & (! [X3,X4,X5] : (($true != (in @ X5 @ (setminus @ X4 @ X3))) | ((in @ X5 @ X3) != $true)) | (setminusER != $true))),
% 0.19/0.38    inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f27,f28])).
% 0.19/0.38  thf(f28,plain,(
% 0.19/0.38    ? [X0,X1,X2] : (((in @ X2 @ (setminus @ X1 @ X0)) = $true) & ((in @ X2 @ X0) = $true)) => (($true = (in @ sK8 @ (setminus @ sK7 @ sK6))) & ($true = (in @ sK8 @ sK6)))),
% 0.19/0.38    introduced(choice_axiom,[])).
% 0.19/0.38  thf(f27,plain,(
% 0.19/0.38    ((setminusER = $true) | ? [X0,X1,X2] : (((in @ X2 @ (setminus @ X1 @ X0)) = $true) & ((in @ X2 @ X0) = $true))) & (! [X3,X4,X5] : (($true != (in @ X5 @ (setminus @ X4 @ X3))) | ((in @ X5 @ X3) != $true)) | (setminusER != $true))),
% 0.19/0.38    inference(rectify,[],[f26])).
% 0.19/0.38  thf(f26,plain,(
% 0.19/0.38    ((setminusER = $true) | ? [X1,X2,X0] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) & ($true = (in @ X0 @ X1)))) & (! [X1,X2,X0] : (((in @ X0 @ (setminus @ X2 @ X1)) != $true) | ($true != (in @ X0 @ X1))) | (setminusER != $true))),
% 0.19/0.38    inference(nnf_transformation,[],[f14])).
% 0.19/0.38  thf(f14,plain,(
% 0.19/0.38    (setminusER = $true) <=> ! [X1,X2,X0] : (((in @ X0 @ (setminus @ X2 @ X1)) != $true) | ($true != (in @ X0 @ X1)))),
% 0.19/0.38    inference(ennf_transformation,[],[f13])).
% 0.19/0.38  thf(f13,plain,(
% 0.19/0.38    ! [X2,X1,X0] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) => ($true != (in @ X0 @ X1))) <=> (setminusER = $true)),
% 0.19/0.38    inference(flattening,[],[f7])).
% 0.19/0.38  thf(f7,plain,(
% 0.19/0.38    ! [X0,X1,X2] : (((in @ X0 @ (setminus @ X2 @ X1)) = $true) => ~($true = (in @ X0 @ X1))) <=> (setminusER = $true)),
% 0.19/0.38    inference(fool_elimination,[],[f6])).
% 0.19/0.38  thf(f6,plain,(
% 0.19/0.38    (! [X0,X1,X2] : ((in @ X0 @ (setminus @ X2 @ X1)) => ~(in @ X0 @ X1)) = setminusER)),
% 0.19/0.38    inference(rectify,[],[f2])).
% 0.19/0.38  thf(f2,axiom,(
% 0.19/0.38    (! [X2,X1,X0] : ((in @ X2 @ (setminus @ X0 @ X1)) => ~(in @ X2 @ X1)) = setminusER)),
% 0.19/0.38    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',setminusER)).
% 0.19/0.38  % SZS output end Proof for theBenchmark
% 0.19/0.38  % (4676)------------------------------
% 0.19/0.38  % (4676)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.19/0.38  % (4676)Termination reason: Refutation
% 0.19/0.38  
% 0.19/0.38  % (4676)Memory used [KB]: 5500
% 0.19/0.38  % (4676)Time elapsed: 0.006 s
% 0.19/0.38  % (4676)Instructions burned: 4 (million)
% 0.19/0.38  % (4676)------------------------------
% 0.19/0.38  % (4676)------------------------------
% 0.19/0.38  % (4670)Success in time 0.029 s
% 0.19/0.38  % Vampire---4.8 exiting
%------------------------------------------------------------------------------