TSTP Solution File: SET185+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET185+3 : TPTP v8.1.2. Released v2.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 : Wed May 1 03:45:40 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 39 ( 8 unt; 0 def)
% Number of atoms : 134 ( 17 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 151 ( 56 ~; 56 |; 27 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 74 ( 64 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(subsumption_resolution,[],[f72,f58]) ).
fof(f58,plain,
~ member(sK2(sK1,union(sK0,sK1)),sK1),
inference(subsumption_resolution,[],[f55,f57]) ).
fof(f57,plain,
member(sK2(sK1,union(sK0,sK1)),union(sK0,sK1)),
inference(subsumption_resolution,[],[f54,f33]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KwmDoLCSpN/Vampire---4.8_6587',union_defn) ).
fof(f54,plain,
( member(sK2(sK1,union(sK0,sK1)),union(sK0,sK1))
| member(sK2(sK1,union(sK0,sK1)),sK1) ),
inference(resolution,[],[f47,f51]) ).
fof(f51,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f37,f46]) ).
fof(f46,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f37,plain,
! [X0,X1] :
( X0 = X1
| member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f18,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) )
& ( member(sK2(X0,X1),X1)
| member(sK2(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X3] :
( ( member(X3,X0)
| ~ member(X3,X1) )
& ( member(X3,X1)
| ~ member(X3,X0) ) )
| X0 != X1 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) )
& ( ! [X2] :
( ( member(X2,X0)
| ~ member(X2,X1) )
& ( member(X2,X1)
| ~ member(X2,X0) ) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KwmDoLCSpN/Vampire---4.8_6587',equal_member_defn) ).
fof(f47,plain,
~ sQ4_eqProxy(sK1,union(sK0,sK1)),
inference(equality_proxy_replacement,[],[f26,f46]) ).
fof(f26,plain,
sK1 != union(sK0,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f12,plain,
( sK1 != union(sK0,sK1)
& subset(sK0,sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11]) ).
fof(f11,plain,
( ? [X0,X1] :
( union(X0,X1) != X1
& subset(X0,X1) )
=> ( sK1 != union(sK0,sK1)
& subset(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
? [X0,X1] :
( union(X0,X1) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> union(X0,X1) = X1 ),
file('/export/starexec/sandbox2/tmp/tmp.KwmDoLCSpN/Vampire---4.8_6587',prove_subset_union) ).
fof(f55,plain,
( ~ member(sK2(sK1,union(sK0,sK1)),union(sK0,sK1))
| ~ member(sK2(sK1,union(sK0,sK1)),sK1) ),
inference(resolution,[],[f47,f50]) ).
fof(f50,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
| ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) ),
inference(equality_proxy_replacement,[],[f38,f46]) ).
fof(f38,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK2(X0,X1),X1)
| ~ member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f72,plain,
member(sK2(sK1,union(sK0,sK1)),sK1),
inference(resolution,[],[f71,f53]) ).
fof(f53,plain,
! [X0] :
( ~ member(X0,sK0)
| member(X0,sK1) ),
inference(resolution,[],[f25,f39]) ).
fof(f39,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ member(X3,X0)
| member(X3,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f22,f23]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.KwmDoLCSpN/Vampire---4.8_6587',subset_defn) ).
fof(f25,plain,
subset(sK0,sK1),
inference(cnf_transformation,[],[f12]) ).
fof(f71,plain,
member(sK2(sK1,union(sK0,sK1)),sK0),
inference(subsumption_resolution,[],[f70,f58]) ).
fof(f70,plain,
( member(sK2(sK1,union(sK0,sK1)),sK0)
| member(sK2(sK1,union(sK0,sK1)),sK1) ),
inference(resolution,[],[f57,f31]) ).
fof(f31,plain,
! [X2,X0,X1] :
( ~ member(X2,union(X0,X1))
| member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET185+3 : TPTP v8.1.2. Released v2.2.0.
% 0.14/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 : n016.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 17:52:11 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.KwmDoLCSpN/Vampire---4.8_6587
% 0.61/0.82 % (6838)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.82 % (6842)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 (2995ds/56Mi)
% 0.61/0.82 % (6838)Refutation not found, incomplete strategy% (6838)------------------------------
% 0.61/0.82 % (6838)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (6838)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.82
% 0.61/0.82 % (6838)Memory used [KB]: 967
% 0.61/0.82 % (6838)Time elapsed: 0.002 s
% 0.61/0.82 % (6838)Instructions burned: 2 (million)
% 0.61/0.82 % (6838)------------------------------
% 0.61/0.82 % (6838)------------------------------
% 0.61/0.82 % (6842)First to succeed.
% 0.61/0.82 % (6835)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 (2995ds/34Mi)
% 0.61/0.82 % (6837)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.82 % (6836)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 (2995ds/51Mi)
% 0.61/0.82 % (6839)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 (2995ds/34Mi)
% 0.61/0.82 % (6840)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.82 % (6841)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 (2995ds/83Mi)
% 0.61/0.82 % (6842)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (6842)------------------------------
% 0.61/0.82 % (6842)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (6842)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (6842)Memory used [KB]: 979
% 0.61/0.82 % (6842)Time elapsed: 0.002 s
% 0.61/0.82 % (6842)Instructions burned: 4 (million)
% 0.61/0.82 % (6842)------------------------------
% 0.61/0.82 % (6842)------------------------------
% 0.61/0.82 % (6777)Success in time 0.442 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------