TSTP Solution File: SET945+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET945+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 : n011.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:49:35 EDT 2024
% Result : Theorem 0.54s 0.77s
% Output : Refutation 0.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 6 unt; 0 def)
% Number of atoms : 226 ( 21 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 296 ( 117 ~; 104 |; 61 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 142 ( 118 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f159,plain,
$false,
inference(subsumption_resolution,[],[f157,f79]) ).
fof(f79,plain,
in(sK5(union(sK0),sK1),union(sK0)),
inference(resolution,[],[f70,f58]) ).
fof(f58,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X0) ),
inference(equality_resolution,[],[f46]) ).
fof(f46,plain,
! [X2,X0,X1,X4] :
( in(X4,X0)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ( ( ~ in(sK6(X0,X1,X2),X1)
| ~ in(sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( ( in(sK6(X0,X1,X2),X1)
& in(sK6(X0,X1,X2),X0) )
| in(sK6(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f30,f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( ~ in(sK6(X0,X1,X2),X1)
| ~ in(sK6(X0,X1,X2),X0)
| ~ in(sK6(X0,X1,X2),X2) )
& ( ( in(sK6(X0,X1,X2),X1)
& in(sK6(X0,X1,X2),X0) )
| in(sK6(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f30,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0) )
& ( ( in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(rectify,[],[f29]) ).
fof(f29,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(flattening,[],[f28]) ).
fof(f28,plain,
! [X0,X1,X2] :
( ( set_intersection2(X0,X1) = X2
| ? [X3] :
( ( ~ in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ~ in(X3,X1)
| ~ in(X3,X0) )
& ( ( in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_intersection2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1,X2] :
( set_intersection2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a65CIrVvQO/Vampire---4.8_18998',d3_xboole_0) ).
fof(f70,plain,
in(sK5(union(sK0),sK1),set_intersection2(union(sK0),sK1)),
inference(resolution,[],[f34,f42]) ).
fof(f42,plain,
! [X0,X1] :
( disjoint(X0,X1)
| in(sK5(X0,X1),set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f27,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ( in(sK5(X0,X1),set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f16,f26]) ).
fof(f26,plain,
! [X0,X1] :
( ? [X3] : in(X3,set_intersection2(X0,X1))
=> in(sK5(X0,X1),set_intersection2(X0,X1)) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( ( ~ disjoint(X0,X1)
| ! [X2] : ~ in(X2,set_intersection2(X0,X1)) )
& ( ? [X3] : in(X3,set_intersection2(X0,X1))
| disjoint(X0,X1) ) ),
inference(ennf_transformation,[],[f12]) ).
fof(f12,plain,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X0,X1] :
( ~ ( disjoint(X0,X1)
& ? [X2] : in(X2,set_intersection2(X0,X1)) )
& ~ ( ! [X2] : ~ in(X2,set_intersection2(X0,X1))
& ~ disjoint(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a65CIrVvQO/Vampire---4.8_18998',t4_xboole_0) ).
fof(f34,plain,
~ disjoint(union(sK0),sK1),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
( ~ disjoint(union(sK0),sK1)
& ! [X2] :
( disjoint(X2,sK1)
| ~ in(X2,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f14,f18]) ).
fof(f18,plain,
( ? [X0,X1] :
( ~ disjoint(union(X0),X1)
& ! [X2] :
( disjoint(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ disjoint(union(sK0),sK1)
& ! [X2] :
( disjoint(X2,sK1)
| ~ in(X2,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
? [X0,X1] :
( ~ disjoint(union(X0),X1)
& ! [X2] :
( disjoint(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f11]) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> disjoint(X2,X1) )
=> disjoint(union(X0),X1) ),
inference(negated_conjecture,[],[f10]) ).
fof(f10,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> disjoint(X2,X1) )
=> disjoint(union(X0),X1) ),
file('/export/starexec/sandbox2/tmp/tmp.a65CIrVvQO/Vampire---4.8_18998',t98_zfmisc_1) ).
fof(f157,plain,
~ in(sK5(union(sK0),sK1),union(sK0)),
inference(resolution,[],[f155,f80]) ).
fof(f80,plain,
in(sK5(union(sK0),sK1),sK1),
inference(resolution,[],[f70,f57]) ).
fof(f57,plain,
! [X0,X1,X4] :
( ~ in(X4,set_intersection2(X0,X1))
| in(X4,X1) ),
inference(equality_resolution,[],[f47]) ).
fof(f47,plain,
! [X2,X0,X1,X4] :
( in(X4,X1)
| ~ in(X4,X2)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f155,plain,
! [X0] :
( ~ in(X0,sK1)
| ~ in(X0,union(sK0)) ),
inference(duplicate_literal_removal,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ~ in(X0,union(sK0))
| ~ in(X0,sK1)
| ~ in(X0,union(sK0)) ),
inference(resolution,[],[f93,f55]) ).
fof(f55,plain,
! [X0,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f36]) ).
fof(f36,plain,
! [X0,X1,X5] :
( in(X5,sK4(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f25,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK2(X0,X1),X3) )
| ~ in(sK2(X0,X1),X1) )
& ( ( in(sK3(X0,X1),X0)
& in(sK2(X0,X1),sK3(X0,X1)) )
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK4(X0,X5),X0)
& in(X5,sK4(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f21,f24,f23,f22]) ).
fof(f22,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK2(X0,X1),X3) )
| ~ in(sK2(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK2(X0,X1),X4) )
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK2(X0,X1),X4) )
=> ( in(sK3(X0,X1),X0)
& in(sK2(X0,X1),sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK4(X0,X5),X0)
& in(X5,sK4(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f20]) ).
fof(f20,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.a65CIrVvQO/Vampire---4.8_18998',d4_tarski) ).
fof(f93,plain,
! [X0,X1] :
( ~ in(X1,sK4(sK0,X0))
| ~ in(X0,union(sK0))
| ~ in(X1,sK1) ),
inference(resolution,[],[f76,f54]) ).
fof(f54,plain,
! [X0,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f37]) ).
fof(f37,plain,
! [X0,X1,X5] :
( in(sK4(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f76,plain,
! [X0,X1] :
( ~ in(X1,sK0)
| ~ in(X0,sK1)
| ~ in(X0,X1) ),
inference(resolution,[],[f71,f56]) ).
fof(f56,plain,
! [X0,X1,X4] :
( in(X4,set_intersection2(X0,X1))
| ~ in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f48]) ).
fof(f48,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X1)
| ~ in(X4,X0)
| set_intersection2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f32]) ).
fof(f71,plain,
! [X0,X1] :
( ~ in(X0,sK0)
| ~ in(X1,set_intersection2(X0,sK1)) ),
inference(resolution,[],[f33,f43]) ).
fof(f43,plain,
! [X2,X0,X1] :
( ~ disjoint(X0,X1)
| ~ in(X2,set_intersection2(X0,X1)) ),
inference(cnf_transformation,[],[f27]) ).
fof(f33,plain,
! [X2] :
( disjoint(X2,sK1)
| ~ in(X2,sK0) ),
inference(cnf_transformation,[],[f19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET945+1 : TPTP v8.1.2. Released v3.2.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.14/0.36 % Computer : n011.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 17:17:46 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.a65CIrVvQO/Vampire---4.8_18998
% 0.54/0.76 % (19191)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.54/0.77 % (19193)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.54/0.77 % (19186)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.54/0.77 % (19187)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.54/0.77 % (19188)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.54/0.77 % (19191)Refutation not found, incomplete strategy% (19191)------------------------------
% 0.54/0.77 % (19191)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.77 % (19191)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.77
% 0.54/0.77 % (19191)Memory used [KB]: 1035
% 0.54/0.77 % (19191)Time elapsed: 0.002 s
% 0.54/0.77 % (19191)Instructions burned: 3 (million)
% 0.54/0.77 % (19191)------------------------------
% 0.54/0.77 % (19191)------------------------------
% 0.54/0.77 % (19189)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.54/0.77 % (19190)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.54/0.77 % (19192)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.54/0.77 % (19193)First to succeed.
% 0.54/0.77 % (19190)Refutation not found, incomplete strategy% (19190)------------------------------
% 0.54/0.77 % (19190)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.77 % (19190)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.77
% 0.54/0.77 % (19190)Memory used [KB]: 1041
% 0.54/0.77 % (19190)Time elapsed: 0.003 s
% 0.54/0.77 % (19190)Instructions burned: 3 (million)
% 0.54/0.77 % (19190)------------------------------
% 0.54/0.77 % (19190)------------------------------
% 0.54/0.77 % (19189)Refutation not found, incomplete strategy% (19189)------------------------------
% 0.54/0.77 % (19189)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.77 % (19193)Refutation found. Thanks to Tanya!
% 0.54/0.77 % SZS status Theorem for Vampire---4
% 0.54/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.54/0.77 % (19193)------------------------------
% 0.54/0.77 % (19193)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.54/0.77 % (19193)Termination reason: Refutation
% 0.54/0.77
% 0.54/0.77 % (19193)Memory used [KB]: 1059
% 0.54/0.77 % (19193)Time elapsed: 0.004 s
% 0.54/0.77 % (19193)Instructions burned: 8 (million)
% 0.54/0.77 % (19193)------------------------------
% 0.54/0.77 % (19193)------------------------------
% 0.54/0.77 % (19171)Success in time 0.39 s
% 0.54/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------