TSTP Solution File: SEU107+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU107+1 : TPTP v8.2.0. Released v3.2.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 03:44:48 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 13 unt; 0 def)
% Number of atoms : 124 ( 9 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 142 ( 60 ~; 55 |; 19 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 67 ( 62 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f204,plain,
$false,
inference(resolution,[],[f199,f124]) ).
fof(f124,plain,
! [X0] : element(sK6(X0),X0),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0] : element(sK6(X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f7,f82]) ).
fof(f82,plain,
! [X0] :
( ? [X1] : element(X1,X0)
=> element(sK6(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f7,axiom,
! [X0] :
? [X1] : element(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(f199,plain,
! [X0] : ~ element(X0,sK0),
inference(subsumption_resolution,[],[f198,f159]) ).
fof(f159,plain,
~ element(empty_set,sK0),
inference(subsumption_resolution,[],[f156,f93]) ).
fof(f93,plain,
~ empty(sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( ~ in(empty_set,sK0)
& preboolean(sK0)
& ~ empty(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f45,f69]) ).
fof(f69,plain,
( ? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) )
=> ( ~ in(empty_set,sK0)
& preboolean(sK0)
& ~ empty(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f45,plain,
? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) ),
inference(flattening,[],[f44]) ).
fof(f44,plain,
? [X0] :
( ~ in(empty_set,X0)
& preboolean(X0)
& ~ empty(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,negated_conjecture,
~ ! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
inference(negated_conjecture,[],[f22]) ).
fof(f22,conjecture,
! [X0] :
( ( preboolean(X0)
& ~ empty(X0) )
=> in(empty_set,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t18_finsub_1) ).
fof(f156,plain,
( empty(sK0)
| ~ element(empty_set,sK0) ),
inference(resolution,[],[f99,f95]) ).
fof(f95,plain,
~ in(empty_set,sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f99,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f25]) ).
fof(f25,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(f198,plain,
! [X0] :
( element(empty_set,sK0)
| ~ element(X0,sK0) ),
inference(duplicate_literal_removal,[],[f196]) ).
fof(f196,plain,
! [X0] :
( element(empty_set,sK0)
| ~ element(X0,sK0)
| ~ element(X0,sK0) ),
inference(superposition,[],[f190,f161]) ).
fof(f161,plain,
! [X0] : empty_set = set_difference(X0,X0),
inference(resolution,[],[f108,f129]) ).
fof(f129,plain,
! [X0] : subset(X0,X0),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0] : subset(X0,X0),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X0,X1] : subset(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(f108,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| set_difference(X0,X1) = empty_set ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1] :
( ( set_difference(X0,X1) = empty_set
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| set_difference(X0,X1) != empty_set ) ),
inference(nnf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0,X1] :
( set_difference(X0,X1) = empty_set
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t37_xboole_1) ).
fof(f190,plain,
! [X0,X1] :
( element(set_difference(X1,X0),sK0)
| ~ element(X1,sK0)
| ~ element(X0,sK0) ),
inference(subsumption_resolution,[],[f187,f93]) ).
fof(f187,plain,
! [X0,X1] :
( ~ element(X0,sK0)
| ~ element(X1,sK0)
| element(set_difference(X1,X0),sK0)
| empty(sK0) ),
inference(resolution,[],[f176,f94]) ).
fof(f94,plain,
preboolean(sK0),
inference(cnf_transformation,[],[f70]) ).
fof(f176,plain,
! [X2,X0,X1] :
( ~ preboolean(X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| element(set_difference(X1,X2),X0)
| empty(X0) ),
inference(duplicate_literal_removal,[],[f175]) ).
fof(f175,plain,
! [X2,X0,X1] :
( element(set_difference(X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(superposition,[],[f115,f110]) ).
fof(f110,plain,
! [X2,X0,X1] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(flattening,[],[f55]) ).
fof(f55,plain,
! [X0,X1,X2] :
( prebool_difference(X0,X1,X2) = set_difference(X1,X2)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0,X1,X2] :
( ( element(X2,X0)
& element(X1,X0)
& preboolean(X0)
& ~ empty(X0) )
=> prebool_difference(X0,X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(f115,plain,
! [X2,X0,X1] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(flattening,[],[f57]) ).
fof(f57,plain,
! [X0,X1,X2] :
( element(prebool_difference(X0,X1,X2),X0)
| ~ element(X2,X0)
| ~ element(X1,X0)
| ~ preboolean(X0)
| empty(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( element(X2,X0)
& element(X1,X0)
& preboolean(X0)
& ~ empty(X0) )
=> element(prebool_difference(X0,X1,X2),X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU107+1 : TPTP v8.2.0. Released v3.2.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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 17:02:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running 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 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74 % (17686)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.55/0.74 % (17680)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (17682)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.55/0.74 % (17681)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.55/0.74 % (17683)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.55/0.74 % (17684)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.55/0.74 % (17685)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.55/0.74 % (17685)Refutation not found, incomplete strategy% (17685)------------------------------
% 0.55/0.74 % (17685)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (17685)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (17685)Memory used [KB]: 975
% 0.55/0.74 % (17685)Time elapsed: 0.003 s
% 0.55/0.74 % (17685)Instructions burned: 2 (million)
% 0.55/0.74 % (17683)Refutation not found, incomplete strategy% (17683)------------------------------
% 0.55/0.74 % (17683)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (17683)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (17683)Memory used [KB]: 983
% 0.55/0.74 % (17683)Time elapsed: 0.003 s
% 0.55/0.74 % (17683)Instructions burned: 3 (million)
% 0.55/0.74 % (17684)Refutation not found, incomplete strategy% (17684)------------------------------
% 0.55/0.74 % (17684)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.74 % (17684)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.74
% 0.55/0.74 % (17684)Memory used [KB]: 1051
% 0.55/0.74 % (17684)Time elapsed: 0.003 s
% 0.55/0.74 % (17684)Instructions burned: 3 (million)
% 0.55/0.74 % (17683)------------------------------
% 0.55/0.74 % (17683)------------------------------
% 0.55/0.74 % (17684)------------------------------
% 0.55/0.74 % (17684)------------------------------
% 0.55/0.75 % (17685)------------------------------
% 0.55/0.75 % (17685)------------------------------
% 0.55/0.75 % (17682)First to succeed.
% 0.55/0.75 % (17680)Refutation not found, incomplete strategy% (17680)------------------------------
% 0.55/0.75 % (17680)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (17680)Termination reason: Refutation not found, incomplete strategy
% 0.55/0.75
% 0.55/0.75 % (17680)Memory used [KB]: 1063
% 0.55/0.75 % (17680)Time elapsed: 0.006 s
% 0.55/0.75 % (17680)Instructions burned: 8 (million)
% 0.55/0.75 % (17680)------------------------------
% 0.55/0.75 % (17680)------------------------------
% 0.55/0.75 % (17682)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-17679"
% 0.55/0.75 % (17687)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.55/0.75 % (17690)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2996ds/208Mi)
% 0.55/0.75 % (17682)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for theBenchmark
% 0.55/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.55/0.75 % (17682)------------------------------
% 0.55/0.75 % (17682)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.55/0.75 % (17682)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (17682)Memory used [KB]: 1076
% 0.55/0.75 % (17682)Time elapsed: 0.007 s
% 0.55/0.75 % (17682)Instructions burned: 8 (million)
% 0.55/0.75 % (17679)Success in time 0.39 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------