TSTP Solution File: SET630+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET630+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 : n015.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:48:24 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 35 ( 18 unt; 0 def)
% Number of atoms : 64 ( 4 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 56 ( 27 ~; 19 |; 5 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 40 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f120,plain,
$false,
inference(avatar_sat_refutation,[],[f113,f116,f119]) ).
fof(f119,plain,
~ spl4_1,
inference(avatar_contradiction_clause,[],[f117]) ).
fof(f117,plain,
( $false
| ~ spl4_1 ),
inference(resolution,[],[f108,f64]) ).
fof(f64,plain,
! [X0,X1] : ~ intersect(intersection(X1,X0),difference(X0,X1)),
inference(superposition,[],[f61,f45]) ).
fof(f45,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',commutativity_of_intersection) ).
fof(f61,plain,
! [X0,X1] : ~ intersect(intersection(X0,X1),difference(X0,X1)),
inference(resolution,[],[f35,f42]) ).
fof(f42,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| intersect(X0,X1) )
& ( ~ intersect(X0,X1)
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> ~ intersect(X0,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',disjoint_defn) ).
fof(f35,plain,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
inference(cnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] : disjoint(intersection(X0,X1),difference(X0,X1)),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',intersection_and_union_disjoint) ).
fof(f108,plain,
( intersect(intersection(sK2,sK3),difference(sK3,sK2))
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f106]) ).
fof(f106,plain,
( spl4_1
<=> intersect(intersection(sK2,sK3),difference(sK3,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f116,plain,
~ spl4_2,
inference(avatar_contradiction_clause,[],[f114]) ).
fof(f114,plain,
( $false
| ~ spl4_2 ),
inference(resolution,[],[f112,f61]) ).
fof(f112,plain,
( intersect(intersection(sK2,sK3),difference(sK2,sK3))
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f110]) ).
fof(f110,plain,
( spl4_2
<=> intersect(intersection(sK2,sK3),difference(sK2,sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f113,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f98,f110,f106]) ).
fof(f98,plain,
( intersect(intersection(sK2,sK3),difference(sK2,sK3))
| intersect(intersection(sK2,sK3),difference(sK3,sK2)) ),
inference(resolution,[],[f32,f57]) ).
fof(f57,plain,
intersect(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
inference(resolution,[],[f43,f54]) ).
fof(f54,plain,
~ disjoint(intersection(sK2,sK3),union(difference(sK2,sK3),difference(sK3,sK2))),
inference(definition_unfolding,[],[f52,f31]) ).
fof(f31,plain,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
inference(cnf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] : symmetric_difference(X0,X1) = union(difference(X0,X1),difference(X1,X0)),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',symmetric_difference_defn) ).
fof(f52,plain,
~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f15,f29]) ).
fof(f29,plain,
( ? [X0,X1] : ~ disjoint(intersection(X0,X1),symmetric_difference(X0,X1))
=> ~ disjoint(intersection(sK2,sK3),symmetric_difference(sK2,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f15,plain,
? [X0,X1] : ~ disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
inference(ennf_transformation,[],[f13]) ).
fof(f13,negated_conjecture,
~ ! [X0,X1] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
inference(negated_conjecture,[],[f12]) ).
fof(f12,conjecture,
! [X0,X1] : disjoint(intersection(X0,X1),symmetric_difference(X0,X1)),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',prove_intersection_and_symmetric_difference_disjoint) ).
fof(f43,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f32,plain,
! [X2,X0,X1] :
( ~ intersect(X0,union(X1,X2))
| intersect(X0,X1)
| intersect(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( intersect(X0,union(X1,X2))
| ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) ) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ) ),
inference(flattening,[],[f16]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( intersect(X0,union(X1,X2))
| ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) ) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| ~ intersect(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1,X2] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i55NOaSPSU/Vampire---4.8_26578',intersect_with_union) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET630+3 : 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n015.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 17:38:33 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.i55NOaSPSU/Vampire---4.8_26578
% 0.56/0.75 % (26802)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.56/0.75 % (26801)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.56/0.75 % (26802)Refutation not found, incomplete strategy% (26802)------------------------------
% 0.56/0.75 % (26802)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (26802)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (26802)Memory used [KB]: 964
% 0.56/0.75 % (26802)Time elapsed: 0.002 s
% 0.56/0.75 % (26802)Instructions burned: 2 (million)
% 0.56/0.75 % (26802)------------------------------
% 0.56/0.75 % (26802)------------------------------
% 0.56/0.75 % (26795)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.56/0.75 % (26798)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.56/0.75 % (26797)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.56/0.75 % (26796)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.56/0.75 % (26799)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.56/0.75 % (26800)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.56/0.75 % (26798)Refutation not found, incomplete strategy% (26798)------------------------------
% 0.56/0.75 % (26798)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (26798)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (26798)Memory used [KB]: 948
% 0.56/0.75 % (26798)Time elapsed: 0.002 s
% 0.56/0.75 % (26798)Instructions burned: 2 (million)
% 0.56/0.75 % (26798)------------------------------
% 0.56/0.75 % (26798)------------------------------
% 0.56/0.75 % (26795)Refutation not found, incomplete strategy% (26795)------------------------------
% 0.56/0.75 % (26795)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (26795)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (26795)Memory used [KB]: 982
% 0.56/0.75 % (26795)Time elapsed: 0.003 s
% 0.56/0.75 % (26795)Instructions burned: 2 (million)
% 0.56/0.75 % (26795)------------------------------
% 0.56/0.75 % (26795)------------------------------
% 0.56/0.75 % (26800)Refutation not found, incomplete strategy% (26800)------------------------------
% 0.56/0.75 % (26800)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (26800)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (26800)Memory used [KB]: 965
% 0.56/0.75 % (26799)Refutation not found, incomplete strategy% (26799)------------------------------
% 0.56/0.75 % (26799)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.75 % (26800)Time elapsed: 0.003 s
% 0.56/0.75 % (26800)Instructions burned: 2 (million)
% 0.56/0.75 % (26800)------------------------------
% 0.56/0.75 % (26800)------------------------------
% 0.56/0.75 % (26799)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.75
% 0.56/0.75 % (26799)Memory used [KB]: 971
% 0.56/0.75 % (26799)Time elapsed: 0.003 s
% 0.56/0.75 % (26799)Instructions burned: 3 (million)
% 0.56/0.75 % (26799)------------------------------
% 0.56/0.75 % (26799)------------------------------
% 0.56/0.75 % (26805)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.56/0.75 % (26796)First to succeed.
% 0.56/0.76 % (26796)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.76 % (26796)------------------------------
% 0.56/0.76 % (26796)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.76 % (26796)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (26796)Memory used [KB]: 1061
% 0.56/0.76 % (26796)Time elapsed: 0.005 s
% 0.56/0.76 % (26796)Instructions burned: 5 (million)
% 0.56/0.76 % (26796)------------------------------
% 0.56/0.76 % (26796)------------------------------
% 0.56/0.76 % (26766)Success in time 0.389 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------