TSTP Solution File: SET624+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET624+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 : n014.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:22 EDT 2024
% Result : Theorem 0.62s 0.82s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 1 unt; 0 def)
% Number of atoms : 184 ( 0 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 202 ( 79 ~; 89 |; 23 &)
% ( 7 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 68 ( 52 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f177,plain,
$false,
inference(avatar_sat_refutation,[],[f38,f43,f44,f70,f104,f176]) ).
fof(f176,plain,
( ~ spl4_1
| spl4_2
| spl4_3 ),
inference(avatar_contradiction_clause,[],[f175]) ).
fof(f175,plain,
( $false
| ~ spl4_1
| spl4_2
| spl4_3 ),
inference(subsumption_resolution,[],[f172,f129]) ).
fof(f129,plain,
( ~ member(sK3(sK0,union(sK1,sK2)),sK1)
| ~ spl4_1
| spl4_3 ),
inference(unit_resulting_resolution,[],[f105,f109,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( intersect(X0,X1)
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f19,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f17,f18]) ).
fof(f18,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK3(X0,X1),X1)
& member(sK3(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f17,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
| ~ intersect(X0,X1) ) ),
inference(rectify,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ? [X2] :
( member(X2,X1)
& member(X2,X0) )
| ~ intersect(X0,X1) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SvcB1glPb2/Vampire---4.8_5682',intersect_defn) ).
fof(f109,plain,
( member(sK3(sK0,union(sK1,sK2)),sK0)
| ~ spl4_1 ),
inference(unit_resulting_resolution,[],[f32,f27]) ).
fof(f27,plain,
! [X0,X1] :
( member(sK3(X0,X1),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f32,plain,
( intersect(sK0,union(sK1,sK2))
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl4_1
<=> intersect(sK0,union(sK1,sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f105,plain,
( ~ intersect(sK1,sK0)
| spl4_3 ),
inference(unit_resulting_resolution,[],[f42,f26]) ).
fof(f26,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f9]) ).
fof(f9,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( intersect(X0,X1)
=> intersect(X1,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.SvcB1glPb2/Vampire---4.8_5682',symmetry_of_intersect) ).
fof(f42,plain,
( ~ intersect(sK0,sK1)
| spl4_3 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl4_3
<=> intersect(sK0,sK1) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f172,plain,
( member(sK3(sK0,union(sK1,sK2)),sK1)
| ~ spl4_1
| spl4_2 ),
inference(unit_resulting_resolution,[],[f108,f128,f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[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(flattening,[],[f14]) ).
fof(f14,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.SvcB1glPb2/Vampire---4.8_5682',union_defn) ).
fof(f128,plain,
( ~ member(sK3(sK0,union(sK1,sK2)),sK2)
| ~ spl4_1
| spl4_2 ),
inference(unit_resulting_resolution,[],[f71,f109,f29]) ).
fof(f71,plain,
( ~ intersect(sK2,sK0)
| spl4_2 ),
inference(unit_resulting_resolution,[],[f37,f26]) ).
fof(f37,plain,
( ~ intersect(sK0,sK2)
| spl4_2 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl4_2
<=> intersect(sK0,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f108,plain,
( member(sK3(sK0,union(sK1,sK2)),union(sK1,sK2))
| ~ spl4_1 ),
inference(unit_resulting_resolution,[],[f32,f28]) ).
fof(f28,plain,
! [X0,X1] :
( member(sK3(X0,X1),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[],[f19]) ).
fof(f104,plain,
( spl4_1
| ~ spl4_3 ),
inference(avatar_contradiction_clause,[],[f103]) ).
fof(f103,plain,
( $false
| spl4_1
| ~ spl4_3 ),
inference(subsumption_resolution,[],[f91,f87]) ).
fof(f87,plain,
( ! [X0] : member(sK3(sK0,sK1),union(sK1,X0))
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f74,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f74,plain,
( member(sK3(sK0,sK1),sK1)
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f41,f28]) ).
fof(f41,plain,
( intersect(sK0,sK1)
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f91,plain,
( ~ member(sK3(sK0,sK1),union(sK1,sK2))
| spl4_1
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f33,f75,f29]) ).
fof(f75,plain,
( member(sK3(sK0,sK1),sK0)
| ~ spl4_3 ),
inference(unit_resulting_resolution,[],[f41,f27]) ).
fof(f33,plain,
( ~ intersect(sK0,union(sK1,sK2))
| spl4_1 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f70,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_contradiction_clause,[],[f69]) ).
fof(f69,plain,
( $false
| spl4_1
| ~ spl4_2 ),
inference(subsumption_resolution,[],[f63,f57]) ).
fof(f57,plain,
( ! [X0] : member(sK3(sK0,sK2),union(X0,sK2))
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f55,f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f55,plain,
( member(sK3(sK0,sK2),sK2)
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f36,f28]) ).
fof(f36,plain,
( intersect(sK0,sK2)
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f63,plain,
( ~ member(sK3(sK0,sK2),union(sK1,sK2))
| spl4_1
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f51,f33,f29]) ).
fof(f51,plain,
( member(sK3(sK0,sK2),sK0)
| ~ spl4_2 ),
inference(unit_resulting_resolution,[],[f36,f27]) ).
fof(f44,plain,
( spl4_1
| spl4_3
| spl4_2 ),
inference(avatar_split_clause,[],[f20,f35,f40,f31]) ).
fof(f20,plain,
( intersect(sK0,sK2)
| intersect(sK0,sK1)
| intersect(sK0,union(sK1,sK2)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( ( ~ intersect(sK0,sK2)
& ~ intersect(sK0,sK1) )
| ~ intersect(sK0,union(sK1,sK2)) )
& ( intersect(sK0,sK2)
| intersect(sK0,sK1)
| intersect(sK0,union(sK1,sK2)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2] :
( ( ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) )
| ~ intersect(X0,union(X1,X2)) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| intersect(X0,union(X1,X2)) ) )
=> ( ( ( ~ intersect(sK0,sK2)
& ~ intersect(sK0,sK1) )
| ~ intersect(sK0,union(sK1,sK2)) )
& ( intersect(sK0,sK2)
| intersect(sK0,sK1)
| intersect(sK0,union(sK1,sK2)) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ( ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) )
| ~ intersect(X0,union(X1,X2)) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| intersect(X0,union(X1,X2)) ) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
? [X0,X1,X2] :
( ( ( ~ intersect(X0,X2)
& ~ intersect(X0,X1) )
| ~ intersect(X0,union(X1,X2)) )
& ( intersect(X0,X2)
| intersect(X0,X1)
| intersect(X0,union(X1,X2)) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2] :
( intersect(X0,union(X1,X2))
<~> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,negated_conjecture,
~ ! [X0,X1,X2] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
inference(negated_conjecture,[],[f6]) ).
fof(f6,conjecture,
! [X0,X1,X2] :
( intersect(X0,union(X1,X2))
<=> ( intersect(X0,X2)
| intersect(X0,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SvcB1glPb2/Vampire---4.8_5682',prove_intersect_with_union) ).
fof(f43,plain,
( ~ spl4_1
| ~ spl4_3 ),
inference(avatar_split_clause,[],[f21,f40,f31]) ).
fof(f21,plain,
( ~ intersect(sK0,sK1)
| ~ intersect(sK0,union(sK1,sK2)) ),
inference(cnf_transformation,[],[f13]) ).
fof(f38,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f22,f35,f31]) ).
fof(f22,plain,
( ~ intersect(sK0,sK2)
| ~ intersect(sK0,union(sK1,sK2)) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET624+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.12 % 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.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Apr 30 17:10:33 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 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.SvcB1glPb2/Vampire---4.8_5682
% 0.62/0.82 % (5802)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.62/0.82 % (5800)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.62/0.82 % (5799)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.62/0.82 % (5801)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.62/0.82 % (5798)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.62/0.82 % (5803)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.62/0.82 % (5804)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.62/0.82 % (5805)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.62/0.82 % (5803)Refutation not found, incomplete strategy% (5803)------------------------------
% 0.62/0.82 % (5803)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82 % (5805)Refutation not found, incomplete strategy% (5805)------------------------------
% 0.62/0.82 % (5805)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82 % (5805)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82
% 0.62/0.82 % (5805)Memory used [KB]: 980
% 0.62/0.82 % (5805)Time elapsed: 0.003 s
% 0.62/0.82 % (5805)Instructions burned: 3 (million)
% 0.62/0.82 % (5805)------------------------------
% 0.62/0.82 % (5805)------------------------------
% 0.62/0.82 % (5803)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82
% 0.62/0.82 % (5803)Memory used [KB]: 980
% 0.62/0.82 % (5803)Time elapsed: 0.003 s
% 0.62/0.82 % (5803)Instructions burned: 3 (million)
% 0.62/0.82 % (5803)------------------------------
% 0.62/0.82 % (5803)------------------------------
% 0.62/0.82 % (5802)Refutation not found, incomplete strategy% (5802)------------------------------
% 0.62/0.82 % (5802)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.82 % (5802)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.82
% 0.62/0.82 % (5802)Memory used [KB]: 1052
% 0.62/0.82 % (5802)Time elapsed: 0.004 s
% 0.62/0.82 % (5802)Instructions burned: 4 (million)
% 0.62/0.82 % (5802)------------------------------
% 0.62/0.82 % (5802)------------------------------
% 0.62/0.82 % (5801)First to succeed.
% 0.62/0.82 % (5801)Refutation found. Thanks to Tanya!
% 0.62/0.82 % SZS status Theorem for Vampire---4
% 0.62/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.83 % (5801)------------------------------
% 0.62/0.83 % (5801)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.83 % (5801)Termination reason: Refutation
% 0.62/0.83
% 0.62/0.83 % (5801)Memory used [KB]: 1069
% 0.62/0.83 % (5801)Time elapsed: 0.006 s
% 0.62/0.83 % (5801)Instructions burned: 7 (million)
% 0.62/0.83 % (5801)------------------------------
% 0.62/0.83 % (5801)------------------------------
% 0.62/0.83 % (5789)Success in time 0.489 s
% 0.62/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------