TSTP Solution File: SEU114+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU114+1 : TPTP v8.1.2. 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 : n016.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:20:18 EDT 2024
% Result : Theorem 0.78s 0.90s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 45 ( 16 unt; 0 def)
% Number of atoms : 91 ( 9 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 77 ( 31 ~; 25 |; 4 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 50 ( 49 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1617,plain,
$false,
inference(avatar_sat_refutation,[],[f1470,f1614,f1616]) ).
fof(f1616,plain,
spl13_10,
inference(avatar_split_clause,[],[f1615,f1467]) ).
fof(f1467,plain,
( spl13_10
<=> finite(sK10(powerset(sK0),finite_subsets(sK0))) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_10])]) ).
fof(f1615,plain,
finite(sK10(powerset(sK0),finite_subsets(sK0))),
inference(subsumption_resolution,[],[f1607,f62]) ).
fof(f62,plain,
finite(sK0),
inference(cnf_transformation,[],[f39]) ).
fof(f39,plain,
? [X0] :
( powerset(X0) != finite_subsets(X0)
& finite(X0) ),
inference(ennf_transformation,[],[f30]) ).
fof(f30,negated_conjecture,
~ ! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
inference(negated_conjecture,[],[f29]) ).
fof(f29,conjecture,
! [X0] :
( finite(X0)
=> powerset(X0) = finite_subsets(X0) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',t27_finsub_1) ).
fof(f1607,plain,
( ~ finite(sK0)
| finite(sK10(powerset(sK0),finite_subsets(sK0))) ),
inference(resolution,[],[f901,f86]) ).
fof(f86,plain,
! [X0,X1] :
( ~ element(X1,powerset(X0))
| ~ finite(X0)
| finite(X1) ),
inference(cnf_transformation,[],[f45]) ).
fof(f45,plain,
! [X0] :
( ! [X1] :
( finite(X1)
| ~ element(X1,powerset(X0)) )
| ~ finite(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( finite(X0)
=> ! [X1] :
( element(X1,powerset(X0))
=> finite(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',cc2_finset_1) ).
fof(f901,plain,
element(sK10(powerset(sK0),finite_subsets(sK0)),powerset(sK0)),
inference(unit_resulting_resolution,[],[f276,f104]) ).
fof(f104,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( element(X0,X1)
| ~ in(X0,X1) ),
inference(ennf_transformation,[],[f27]) ).
fof(f27,axiom,
! [X0,X1] :
( in(X0,X1)
=> element(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',t1_subset) ).
fof(f276,plain,
in(sK10(powerset(sK0),finite_subsets(sK0)),powerset(sK0)),
inference(unit_resulting_resolution,[],[f184,f106]) ).
fof(f106,plain,
! [X0,X1] :
( in(sK10(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',d3_tarski) ).
fof(f184,plain,
~ subset(powerset(sK0),finite_subsets(sK0)),
inference(unit_resulting_resolution,[],[f87,f63,f74]) ).
fof(f74,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',d10_xboole_0) ).
fof(f63,plain,
powerset(sK0) != finite_subsets(sK0),
inference(cnf_transformation,[],[f39]) ).
fof(f87,plain,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
inference(cnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] : subset(finite_subsets(X0),powerset(X0)),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',t26_finsub_1) ).
fof(f1614,plain,
spl13_9,
inference(avatar_contradiction_clause,[],[f1613]) ).
fof(f1613,plain,
( $false
| spl13_9 ),
inference(subsumption_resolution,[],[f1605,f1465]) ).
fof(f1465,plain,
( ~ subset(sK10(powerset(sK0),finite_subsets(sK0)),sK0)
| spl13_9 ),
inference(avatar_component_clause,[],[f1463]) ).
fof(f1463,plain,
( spl13_9
<=> subset(sK10(powerset(sK0),finite_subsets(sK0)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl13_9])]) ).
fof(f1605,plain,
subset(sK10(powerset(sK0),finite_subsets(sK0)),sK0),
inference(resolution,[],[f901,f117]) ).
fof(f117,plain,
! [X0,X1] :
( ~ element(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',t3_subset) ).
fof(f1470,plain,
( ~ spl13_9
| ~ spl13_10 ),
inference(avatar_split_clause,[],[f1461,f1467,f1463]) ).
fof(f1461,plain,
( ~ finite(sK10(powerset(sK0),finite_subsets(sK0)))
| ~ subset(sK10(powerset(sK0),finite_subsets(sK0)),sK0) ),
inference(resolution,[],[f928,f65]) ).
fof(f65,plain,
! [X2,X0] :
( sP2(X2,X0)
| ~ finite(X2)
| ~ subset(X2,X0) ),
inference(cnf_transformation,[],[f41]) ).
fof(f41,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',d5_finsub_1) ).
fof(f928,plain,
~ sP2(sK10(powerset(sK0),finite_subsets(sK0)),sK0),
inference(unit_resulting_resolution,[],[f92,f277,f121]) ).
fof(f121,plain,
! [X2,X0] :
( in(X2,finite_subsets(X0))
| ~ sP2(X2,X0)
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f68]) ).
fof(f68,plain,
! [X2,X0,X1] :
( ~ preboolean(X1)
| ~ sP2(X2,X0)
| in(X2,X1)
| finite_subsets(X0) != X1 ),
inference(cnf_transformation,[],[f41]) ).
fof(f277,plain,
~ in(sK10(powerset(sK0),finite_subsets(sK0)),finite_subsets(sK0)),
inference(unit_resulting_resolution,[],[f184,f107]) ).
fof(f107,plain,
! [X0,X1] :
( ~ in(sK10(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f57]) ).
fof(f92,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0] : preboolean(finite_subsets(X0)),
file('/export/starexec/sandbox2/tmp/tmp.jQd2V7Gpxu/Vampire---4.8_5892',dt_k5_finsub_1) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU114+1 : TPTP v8.1.2. Released v3.2.0.
% 0.07/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.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 12:15:45 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.jQd2V7Gpxu/Vampire---4.8_5892
% 0.71/0.87 % (6141)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 (2994ds/34Mi)
% 0.71/0.87 % (6148)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 (2994ds/83Mi)
% 0.71/0.87 % (6144)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.71/0.87 % (6143)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.71/0.87 % (6142)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 (2994ds/51Mi)
% 0.71/0.87 % (6146)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 (2994ds/34Mi)
% 0.71/0.87 % (6147)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.71/0.87 % (6149)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 (2994ds/56Mi)
% 0.71/0.88 % (6147)Refutation not found, incomplete strategy% (6147)------------------------------
% 0.71/0.88 % (6147)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (6147)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.88
% 0.71/0.88 % (6147)Memory used [KB]: 1036
% 0.71/0.88 % (6147)Time elapsed: 0.003 s
% 0.71/0.88 % (6147)Instructions burned: 3 (million)
% 0.71/0.88 % (6149)Refutation not found, incomplete strategy% (6149)------------------------------
% 0.71/0.88 % (6149)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (6149)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.88
% 0.71/0.88 % (6149)Memory used [KB]: 1050
% 0.71/0.88 % (6149)Time elapsed: 0.004 s
% 0.71/0.88 % (6149)Instructions burned: 3 (million)
% 0.71/0.88 % (6147)------------------------------
% 0.71/0.88 % (6147)------------------------------
% 0.71/0.88 % (6141)Refutation not found, incomplete strategy% (6141)------------------------------
% 0.71/0.88 % (6141)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.88 % (6141)Termination reason: Refutation not found, incomplete strategy
% 0.71/0.88
% 0.71/0.88 % (6141)Memory used [KB]: 1068
% 0.71/0.88 % (6141)Time elapsed: 0.004 s
% 0.71/0.88 % (6141)Instructions burned: 5 (million)
% 0.71/0.88 % (6149)------------------------------
% 0.71/0.88 % (6149)------------------------------
% 0.71/0.88 % (6141)------------------------------
% 0.71/0.88 % (6141)------------------------------
% 0.71/0.88 % (6151)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 (2994ds/50Mi)
% 0.71/0.88 % (6150)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 (2994ds/55Mi)
% 0.71/0.88 % (6152)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 (2994ds/208Mi)
% 0.71/0.89 % (6144)Instruction limit reached!
% 0.71/0.89 % (6144)------------------------------
% 0.71/0.89 % (6144)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.89 % (6144)Termination reason: Unknown
% 0.71/0.89 % (6144)Termination phase: Saturation
% 0.71/0.89
% 0.71/0.89 % (6144)Memory used [KB]: 1770
% 0.71/0.89 % (6144)Time elapsed: 0.018 s
% 0.71/0.89 % (6144)Instructions burned: 34 (million)
% 0.71/0.89 % (6144)------------------------------
% 0.71/0.89 % (6144)------------------------------
% 0.71/0.89 % (6153)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 (2994ds/52Mi)
% 0.71/0.89 % (6146)Instruction limit reached!
% 0.71/0.89 % (6146)------------------------------
% 0.71/0.89 % (6146)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.71/0.89 % (6146)Termination reason: Unknown
% 0.71/0.89 % (6146)Termination phase: Saturation
% 0.71/0.89
% 0.71/0.89 % (6146)Memory used [KB]: 1495
% 0.71/0.89 % (6146)Time elapsed: 0.022 s
% 0.71/0.89 % (6146)Instructions burned: 34 (million)
% 0.71/0.89 % (6146)------------------------------
% 0.71/0.89 % (6146)------------------------------
% 0.78/0.89 % (6148)First to succeed.
% 0.78/0.90 % (6148)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6100"
% 0.78/0.90 % (6148)Refutation found. Thanks to Tanya!
% 0.78/0.90 % SZS status Theorem for Vampire---4
% 0.78/0.90 % SZS output start Proof for Vampire---4
% See solution above
% 0.78/0.90 % (6148)------------------------------
% 0.78/0.90 % (6148)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.78/0.90 % (6148)Termination reason: Refutation
% 0.78/0.90
% 0.78/0.90 % (6148)Memory used [KB]: 1600
% 0.78/0.90 % (6148)Time elapsed: 0.023 s
% 0.78/0.90 % (6148)Instructions burned: 42 (million)
% 0.78/0.90 % (6100)Success in time 0.532 s
% 0.78/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------