TSTP Solution File: SEU117+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU117+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 : n025.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 : Wed May 1 03:50:07 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 8 unt; 0 def)
% Number of atoms : 137 ( 11 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 166 ( 61 ~; 60 |; 34 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 54 ( 46 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f180,plain,
$false,
inference(subsumption_resolution,[],[f179,f110]) ).
fof(f110,plain,
! [X0] : preboolean(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f13,axiom,
! [X0] :
( preboolean(finite_subsets(X0))
& diff_closed(finite_subsets(X0))
& cup_closed(finite_subsets(X0))
& ~ empty(finite_subsets(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.H187gkcWHI/Vampire---4.8_15740',fc2_finsub_1) ).
fof(f179,plain,
~ preboolean(finite_subsets(sK10)),
inference(subsumption_resolution,[],[f171,f164]) ).
fof(f164,plain,
~ subset(sK11,sK10),
inference(resolution,[],[f143,f139]) ).
fof(f139,plain,
! [X0,X1] :
( element(X0,powerset(X1))
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f84]) ).
fof(f84,plain,
! [X0,X1] :
( ( element(X0,powerset(X1))
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ element(X0,powerset(X1)) ) ),
inference(nnf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( element(X0,powerset(X1))
<=> subset(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.H187gkcWHI/Vampire---4.8_15740',t3_subset) ).
fof(f143,plain,
~ element(sK11,powerset(sK10)),
inference(cnf_transformation,[],[f86]) ).
fof(f86,plain,
( ~ element(sK11,powerset(sK10))
& element(sK11,finite_subsets(sK10)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f62,f85]) ).
fof(f85,plain,
( ? [X0,X1] :
( ~ element(X1,powerset(X0))
& element(X1,finite_subsets(X0)) )
=> ( ~ element(sK11,powerset(sK10))
& element(sK11,finite_subsets(sK10)) ) ),
introduced(choice_axiom,[]) ).
fof(f62,plain,
? [X0,X1] :
( ~ element(X1,powerset(X0))
& element(X1,finite_subsets(X0)) ),
inference(ennf_transformation,[],[f32]) ).
fof(f32,negated_conjecture,
~ ! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
! [X0,X1] :
( element(X1,finite_subsets(X0))
=> element(X1,powerset(X0)) ),
file('/export/starexec/sandbox2/tmp/tmp.H187gkcWHI/Vampire---4.8_15740',t32_finsub_1) ).
fof(f171,plain,
( subset(sK11,sK10)
| ~ preboolean(finite_subsets(sK10)) ),
inference(resolution,[],[f163,f152]) ).
fof(f152,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,finite_subsets(X0))
| ~ preboolean(finite_subsets(X0)) ),
inference(equality_resolution,[],[f144]) ).
fof(f144,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| finite_subsets(X0) != X1
| ~ preboolean(X1) ),
inference(cnf_transformation,[],[f91]) ).
fof(f91,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ( ( ~ finite(sK12(X0,X1))
| ~ subset(sK12(X0,X1),X0)
| ~ in(sK12(X0,X1),X1) )
& ( ( finite(sK12(X0,X1))
& subset(sK12(X0,X1),X0) )
| in(sK12(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12])],[f89,f90]) ).
fof(f90,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) )
=> ( ( ~ finite(sK12(X0,X1))
| ~ subset(sK12(X0,X1),X0)
| ~ in(sK12(X0,X1),X1) )
& ( ( finite(sK12(X0,X1))
& subset(sK12(X0,X1),X0) )
| in(sK12(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f89,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ finite(X3)
| ~ subset(X3,X0) )
& ( ( finite(X3)
& subset(X3,X0) )
| ~ in(X3,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(rectify,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(flattening,[],[f87]) ).
fof(f87,plain,
! [X0,X1] :
( ( ( finite_subsets(X0) = X1
| ? [X2] :
( ( ~ finite(X2)
| ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( ( finite(X2)
& subset(X2,X0) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ finite(X2)
| ~ subset(X2,X0) )
& ( ( finite(X2)
& subset(X2,X0) )
| ~ in(X2,X1) ) )
| finite_subsets(X0) != X1 ) )
| ~ preboolean(X1) ),
inference(nnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) )
| ~ preboolean(X1) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,axiom,
! [X0,X1] :
( preboolean(X1)
=> ( finite_subsets(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ( finite(X2)
& subset(X2,X0) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H187gkcWHI/Vampire---4.8_15740',d5_finsub_1) ).
fof(f163,plain,
in(sK11,finite_subsets(sK10)),
inference(subsumption_resolution,[],[f162,f107]) ).
fof(f107,plain,
! [X0] : ~ empty(finite_subsets(X0)),
inference(cnf_transformation,[],[f13]) ).
fof(f162,plain,
( in(sK11,finite_subsets(sK10))
| empty(finite_subsets(sK10)) ),
inference(resolution,[],[f142,f95]) ).
fof(f95,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
fof(f47,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( in(X0,X1)
| empty(X1)
| ~ element(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( element(X0,X1)
=> ( in(X0,X1)
| empty(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.H187gkcWHI/Vampire---4.8_15740',t2_subset) ).
fof(f142,plain,
element(sK11,finite_subsets(sK10)),
inference(cnf_transformation,[],[f86]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU117+1 : TPTP v8.1.2. Released v3.2.0.
% 0.03/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.36 % Computer : n025.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 16:25:41 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.H187gkcWHI/Vampire---4.8_15740
% 0.59/0.74 % (16120)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.59/0.75 % (16120)Refutation not found, incomplete strategy% (16120)------------------------------
% 0.59/0.75 % (16120)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (16120)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (16120)Memory used [KB]: 963
% 0.59/0.75 % (16120)Time elapsed: 0.002 s
% 0.59/0.75 % (16120)Instructions burned: 2 (million)
% 0.59/0.75 % (16120)------------------------------
% 0.59/0.75 % (16120)------------------------------
% 0.59/0.75 % (16115)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.59/0.75 % (16116)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.59/0.75 % (16113)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.59/0.75 % (16118)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.59/0.75 % (16117)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.59/0.75 % (16119)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.59/0.75 % (16114)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.59/0.75 % (16118)Refutation not found, incomplete strategy% (16118)------------------------------
% 0.59/0.75 % (16118)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (16118)Termination reason: Refutation not found, incomplete strategy
% 0.59/0.75
% 0.59/0.75 % (16118)Memory used [KB]: 964
% 0.59/0.75 % (16118)Time elapsed: 0.003 s
% 0.59/0.75 % (16118)Instructions burned: 2 (million)
% 0.59/0.75 % (16118)------------------------------
% 0.59/0.75 % (16118)------------------------------
% 0.59/0.75 % (16117)First to succeed.
% 0.59/0.75 % (16122)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.59/0.75 % (16117)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75 % (16117)------------------------------
% 0.59/0.75 % (16117)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (16117)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (16117)Memory used [KB]: 1061
% 0.59/0.75 % (16117)Time elapsed: 0.004 s
% 0.59/0.75 % (16117)Instructions burned: 5 (million)
% 0.59/0.75 % (16117)------------------------------
% 0.59/0.75 % (16117)------------------------------
% 0.59/0.75 % (15977)Success in time 0.376 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------