TSTP Solution File: SEU325+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.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 : n023.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 : Sun May 5 09:22:19 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 45 ( 20 unt; 0 def)
% Number of atoms : 102 ( 22 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 39 ~; 22 |; 23 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 54 ( 48 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f671,plain,
$false,
inference(subsumption_resolution,[],[f668,f166]) ).
fof(f166,plain,
empty(sK1),
inference(definition_unfolding,[],[f103,f87]) ).
fof(f87,plain,
empty_set = sK1,
inference(cnf_transformation,[],[f52]) ).
fof(f52,plain,
? [X0] :
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(X0,X1)
& element(X1,powerset(powerset(the_carrier(X0)))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(flattening,[],[f51]) ).
fof(f51,plain,
? [X0] :
( ? [X1] :
( empty_set = X1
& is_a_cover_of_carrier(X0,X1)
& element(X1,powerset(powerset(the_carrier(X0)))) )
& one_sorted_str(X0)
& ~ empty_carrier(X0) ),
inference(ennf_transformation,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( empty_set = X1
& is_a_cover_of_carrier(X0,X1) ) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ~ ( empty_set = X1
& is_a_cover_of_carrier(X0,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',t5_tops_2) ).
fof(f103,plain,
empty(empty_set),
inference(cnf_transformation,[],[f33]) ).
fof(f33,axiom,
( v5_membered(empty_set)
& v4_membered(empty_set)
& v3_membered(empty_set)
& v2_membered(empty_set)
& v1_membered(empty_set)
& empty(empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',fc6_membered) ).
fof(f668,plain,
~ empty(sK1),
inference(superposition,[],[f176,f481]) ).
fof(f481,plain,
sK1 = cast_as_carrier_subset(sK0),
inference(forward_demodulation,[],[f454,f479]) ).
fof(f479,plain,
! [X0] : sK1 = union_of_subsets(X0,sK1),
inference(forward_demodulation,[],[f456,f357]) ).
fof(f357,plain,
sK1 = union(sK1),
inference(unit_resulting_resolution,[],[f228,f352,f152]) ).
fof(f152,plain,
! [X0,X1] :
( sP10(sK9(X0,X1),X0)
| in(sK9(X0,X1),X1)
| union(X0) = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',d4_tarski) ).
fof(f352,plain,
! [X0] : ~ sP10(X0,sK1),
inference(unit_resulting_resolution,[],[f228,f149]) ).
fof(f149,plain,
! [X2,X0] :
( in(sK11(X0,X2),X0)
| ~ sP10(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f228,plain,
! [X0] : ~ in(X0,sK1),
inference(unit_resulting_resolution,[],[f166,f154]) ).
fof(f154,plain,
! [X0,X1] :
( ~ in(X0,X1)
| ~ empty(X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X1] :
( ~ empty(X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,axiom,
! [X0,X1] :
~ ( empty(X1)
& in(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',t7_boole) ).
fof(f456,plain,
! [X0] : union(sK1) = union_of_subsets(X0,sK1),
inference(unit_resulting_resolution,[],[f414,f145]) ).
fof(f145,plain,
! [X0,X1] :
( ~ element(X1,powerset(powerset(X0)))
| union_of_subsets(X0,X1) = union(X1) ),
inference(cnf_transformation,[],[f75]) ).
fof(f75,plain,
! [X0,X1] :
( union_of_subsets(X0,X1) = union(X1)
| ~ element(X1,powerset(powerset(X0))) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,axiom,
! [X0,X1] :
( element(X1,powerset(powerset(X0)))
=> union_of_subsets(X0,X1) = union(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',redefinition_k5_setfam_1) ).
fof(f414,plain,
! [X0] : element(sK1,powerset(X0)),
inference(superposition,[],[f91,f221]) ).
fof(f221,plain,
! [X0] : sK1 = sK2(X0),
inference(unit_resulting_resolution,[],[f92,f166,f90]) ).
fof(f90,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(ennf_transformation,[],[f50]) ).
fof(f50,axiom,
! [X0,X1] :
~ ( empty(X1)
& X0 != X1
& empty(X0) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',t8_boole) ).
fof(f92,plain,
! [X0] : empty(sK2(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
? [X1] :
( empty(X1)
& element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',rc2_subset_1) ).
fof(f91,plain,
! [X0] : element(sK2(X0),powerset(X0)),
inference(cnf_transformation,[],[f36]) ).
fof(f454,plain,
cast_as_carrier_subset(sK0) = union_of_subsets(the_carrier(sK0),sK1),
inference(unit_resulting_resolution,[],[f89,f86,f414,f111]) ).
fof(f111,plain,
! [X0,X1] :
( ~ element(X1,powerset(powerset(the_carrier(X0))))
| ~ one_sorted_str(X0)
| cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1)
| ~ is_a_cover_of_carrier(X0,X1) ),
inference(cnf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0] :
( ! [X1] :
( ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) )
| ~ element(X1,powerset(powerset(the_carrier(X0)))) )
| ~ one_sorted_str(X0) ),
inference(ennf_transformation,[],[f19]) ).
fof(f19,axiom,
! [X0] :
( one_sorted_str(X0)
=> ! [X1] :
( element(X1,powerset(powerset(the_carrier(X0))))
=> ( is_a_cover_of_carrier(X0,X1)
<=> cast_as_carrier_subset(X0) = union_of_subsets(the_carrier(X0),X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',d8_pre_topc) ).
fof(f86,plain,
is_a_cover_of_carrier(sK0,sK1),
inference(cnf_transformation,[],[f52]) ).
fof(f89,plain,
one_sorted_str(sK0),
inference(cnf_transformation,[],[f52]) ).
fof(f176,plain,
~ empty(cast_as_carrier_subset(sK0)),
inference(unit_resulting_resolution,[],[f88,f89,f114]) ).
fof(f114,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X0] :
( ~ empty(cast_as_carrier_subset(X0))
| ~ one_sorted_str(X0)
| empty_carrier(X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0] :
( ( one_sorted_str(X0)
& ~ empty_carrier(X0) )
=> ~ empty(cast_as_carrier_subset(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148',fc2_pre_topc) ).
fof(f88,plain,
~ empty_carrier(sK0),
inference(cnf_transformation,[],[f52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SEU325+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.15 % 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.16/0.37 % Computer : n023.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Fri May 3 11:27:54 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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/tmp/tmp.OD0QX56Au3/Vampire---4.8_21148
% 0.60/0.77 % (21633)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.60/0.77 % (21626)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.77 % (21628)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.60/0.77 % (21629)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.60/0.77 % (21630)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 Vampire---4 for (2996ds/34Mi)
% 0.60/0.77 % (21631)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.60/0.77 % (21627)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 Vampire---4 for (2996ds/51Mi)
% 0.60/0.77 % (21632)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 Vampire---4 for (2996ds/83Mi)
% 0.60/0.77 % (21633)Refutation not found, incomplete strategy% (21633)------------------------------
% 0.60/0.77 % (21633)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (21633)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (21633)Memory used [KB]: 1057
% 0.60/0.77 % (21633)Time elapsed: 0.002 s
% 0.60/0.77 % (21633)Instructions burned: 4 (million)
% 0.60/0.77 % (21633)------------------------------
% 0.60/0.77 % (21633)------------------------------
% 0.60/0.77 % (21629)Refutation not found, incomplete strategy% (21629)------------------------------
% 0.60/0.77 % (21629)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (21629)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (21629)Memory used [KB]: 1050
% 0.60/0.77 % (21629)Time elapsed: 0.003 s
% 0.60/0.77 % (21629)Instructions burned: 3 (million)
% 0.60/0.77 % (21629)------------------------------
% 0.60/0.77 % (21629)------------------------------
% 0.60/0.77 % (21631)Refutation not found, incomplete strategy% (21631)------------------------------
% 0.60/0.77 % (21631)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (21631)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (21631)Memory used [KB]: 1055
% 0.60/0.77 % (21631)Time elapsed: 0.004 s
% 0.60/0.77 % (21631)Instructions burned: 5 (million)
% 0.60/0.77 % (21631)------------------------------
% 0.60/0.77 % (21631)------------------------------
% 0.60/0.77 % (21626)Refutation not found, incomplete strategy% (21626)------------------------------
% 0.60/0.77 % (21626)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (21626)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.77
% 0.60/0.77 % (21626)Memory used [KB]: 1096
% 0.60/0.77 % (21637)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on Vampire---4 for (2996ds/55Mi)
% 0.60/0.77 % (21626)Time elapsed: 0.006 s
% 0.60/0.77 % (21626)Instructions burned: 7 (million)
% 0.60/0.77 % (21626)------------------------------
% 0.60/0.77 % (21626)------------------------------
% 0.60/0.77 % (21638)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2996ds/50Mi)
% 0.60/0.78 % (21639)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/208Mi)
% 0.60/0.78 % (21632)First to succeed.
% 0.60/0.78 % (21641)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on Vampire---4 for (2996ds/52Mi)
% 0.60/0.78 % (21632)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-21422"
% 0.60/0.78 % (21628)Also succeeded, but the first one will report.
% 0.60/0.78 % (21632)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for Vampire---4
% 0.60/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.78 % (21632)------------------------------
% 0.60/0.78 % (21632)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (21632)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (21632)Memory used [KB]: 1149
% 0.60/0.78 % (21632)Time elapsed: 0.010 s
% 0.60/0.78 % (21632)Instructions burned: 15 (million)
% 0.60/0.78 % (21422)Success in time 0.397 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------