TSTP Solution File: SET015+4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET015+4 : 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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:02:50 EDT 2024
% Result : Theorem 0.57s 0.76s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 6 unt; 0 def)
% Number of atoms : 134 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 124 ( 46 ~; 52 |; 10 &)
% ( 10 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 57 ( 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f81,plain,
$false,
inference(avatar_sat_refutation,[],[f43,f55,f67,f71,f72,f79,f80]) ).
fof(f80,plain,
( ~ spl3_4
| spl3_1 ),
inference(avatar_split_clause,[],[f77,f36,f52]) ).
fof(f52,plain,
( spl3_4
<=> member(sK2(union(sK0,sK1),union(sK1,sK0)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
fof(f36,plain,
( spl3_1
<=> subset(union(sK0,sK1),union(sK1,sK0)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f77,plain,
( ~ member(sK2(union(sK0,sK1),union(sK1,sK0)),sK0)
| spl3_1 ),
inference(resolution,[],[f74,f30]) ).
fof(f30,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(flattening,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( member(X0,union(X1,X2))
| ( ~ member(X0,X2)
& ~ member(X0,X1) ) )
& ( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
<=> ( member(X0,X2)
| member(X0,X1) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/tmp/tmp.7VdgBSJXtI/Vampire---4.8_13443',union) ).
fof(f74,plain,
( ~ member(sK2(union(sK0,sK1),union(sK1,sK0)),union(sK1,sK0))
| spl3_1 ),
inference(resolution,[],[f38,f33]) ).
fof(f33,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1] :
( subset(X0,X1)
| ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f20,f25]) ).
fof(f25,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK2(X0,X1),X1)
& member(sK2(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
=> member(X2,X1) )
=> subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.7VdgBSJXtI/Vampire---4.8_13443',subset) ).
fof(f38,plain,
( ~ subset(union(sK0,sK1),union(sK1,sK0))
| spl3_1 ),
inference(avatar_component_clause,[],[f36]) ).
fof(f79,plain,
( spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f78]) ).
fof(f78,plain,
( $false
| spl3_1
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f76,f50]) ).
fof(f50,plain,
( member(sK2(union(sK0,sK1),union(sK1,sK0)),sK1)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f48]) ).
fof(f48,plain,
( spl3_3
<=> member(sK2(union(sK0,sK1),union(sK1,sK0)),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f76,plain,
( ~ member(sK2(union(sK0,sK1),union(sK1,sK0)),sK1)
| spl3_1 ),
inference(resolution,[],[f74,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f72,plain,
( ~ spl3_6
| spl3_2 ),
inference(avatar_split_clause,[],[f69,f40,f64]) ).
fof(f64,plain,
( spl3_6
<=> member(sK2(union(sK1,sK0),union(sK0,sK1)),sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
fof(f40,plain,
( spl3_2
<=> subset(union(sK1,sK0),union(sK0,sK1)) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f69,plain,
( ~ member(sK2(union(sK1,sK0),union(sK0,sK1)),sK1)
| spl3_2 ),
inference(resolution,[],[f57,f30]) ).
fof(f57,plain,
( ~ member(sK2(union(sK1,sK0),union(sK0,sK1)),union(sK0,sK1))
| spl3_2 ),
inference(resolution,[],[f42,f33]) ).
fof(f42,plain,
( ~ subset(union(sK1,sK0),union(sK0,sK1))
| spl3_2 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f71,plain,
( spl3_2
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f70]) ).
fof(f70,plain,
( $false
| spl3_2
| ~ spl3_5 ),
inference(subsumption_resolution,[],[f68,f62]) ).
fof(f62,plain,
( member(sK2(union(sK1,sK0),union(sK0,sK1)),sK0)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f60]) ).
fof(f60,plain,
( spl3_5
<=> member(sK2(union(sK1,sK0),union(sK0,sK1)),sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
fof(f68,plain,
( ~ member(sK2(union(sK1,sK0),union(sK0,sK1)),sK0)
| spl3_2 ),
inference(resolution,[],[f57,f29]) ).
fof(f67,plain,
( spl3_5
| spl3_6
| spl3_2 ),
inference(avatar_split_clause,[],[f58,f40,f64,f60]) ).
fof(f58,plain,
( member(sK2(union(sK1,sK0),union(sK0,sK1)),sK1)
| member(sK2(union(sK1,sK0),union(sK0,sK1)),sK0)
| spl3_2 ),
inference(resolution,[],[f56,f28]) ).
fof(f28,plain,
! [X2,X0,X1] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f24]) ).
fof(f56,plain,
( member(sK2(union(sK1,sK0),union(sK0,sK1)),union(sK1,sK0))
| spl3_2 ),
inference(resolution,[],[f42,f32]) ).
fof(f32,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f26]) ).
fof(f55,plain,
( spl3_3
| spl3_4
| spl3_1 ),
inference(avatar_split_clause,[],[f46,f36,f52,f48]) ).
fof(f46,plain,
( member(sK2(union(sK0,sK1),union(sK1,sK0)),sK0)
| member(sK2(union(sK0,sK1),union(sK1,sK0)),sK1)
| spl3_1 ),
inference(resolution,[],[f44,f28]) ).
fof(f44,plain,
( member(sK2(union(sK0,sK1),union(sK1,sK0)),union(sK0,sK1))
| spl3_1 ),
inference(resolution,[],[f38,f32]) ).
fof(f43,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f34,f40,f36]) ).
fof(f34,plain,
( ~ subset(union(sK1,sK0),union(sK0,sK1))
| ~ subset(union(sK0,sK1),union(sK1,sK0)) ),
inference(resolution,[],[f27,f31]) ).
fof(f31,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(flattening,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1] :
( ( subset(X1,X0)
& subset(X0,X1) )
=> equal_set(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( equal_set(X0,X1)
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.7VdgBSJXtI/Vampire---4.8_13443',equal_set) ).
fof(f27,plain,
~ equal_set(union(sK0,sK1),union(sK1,sK0)),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
~ equal_set(union(sK0,sK1),union(sK1,sK0)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f21]) ).
fof(f21,plain,
( ? [X0,X1] : ~ equal_set(union(X0,X1),union(X1,X0))
=> ~ equal_set(union(sK0,sK1),union(sK1,sK0)) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
? [X0,X1] : ~ equal_set(union(X0,X1),union(X1,X0)),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : equal_set(union(X0,X1),union(X1,X0)),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] : equal_set(union(X0,X1),union(X1,X0)),
file('/export/starexec/sandbox/tmp/tmp.7VdgBSJXtI/Vampire---4.8_13443',thI07) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET015+4 : TPTP v8.1.2. Released v2.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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n027.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 : Fri May 3 16:34:53 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.7VdgBSJXtI/Vampire---4.8_13443
% 0.57/0.76 % (13559)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.57/0.76 % (13552)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.57/0.76 % (13554)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.57/0.76 % (13559)First to succeed.
% 0.57/0.76 % (13556)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.57/0.76 % (13553)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.57/0.76 % (13557)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.57/0.76 % (13555)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.57/0.76 % (13558)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.57/0.76 % (13559)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-13551"
% 0.57/0.76 % (13552)Refutation not found, incomplete strategy% (13552)------------------------------
% 0.57/0.76 % (13552)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (13552)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76
% 0.57/0.76 % (13552)Memory used [KB]: 973
% 0.57/0.76 % (13552)Time elapsed: 0.002 s
% 0.57/0.76 % (13552)Instructions burned: 2 (million)
% 0.57/0.76 % (13555)Refutation not found, incomplete strategy% (13555)------------------------------
% 0.57/0.76 % (13555)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (13555)Termination reason: Refutation not found, incomplete strategy
% 0.57/0.76 % (13559)Refutation found. Thanks to Tanya!
% 0.57/0.76 % SZS status Theorem for Vampire---4
% 0.57/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.76 % (13559)------------------------------
% 0.57/0.76 % (13559)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.76 % (13559)Termination reason: Refutation
% 0.57/0.76
% 0.57/0.76 % (13559)Memory used [KB]: 1000
% 0.57/0.76 % (13559)Time elapsed: 0.003 s
% 0.57/0.76 % (13559)Instructions burned: 4 (million)
% 0.57/0.76 % (13551)Success in time 0.393 s
% 0.57/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------