TSTP Solution File: SET628+3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET628+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 : n032.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:07:42 EDT 2024
% Result : Theorem 0.46s 0.71s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 10
% Syntax : Number of formulae : 50 ( 4 unt; 0 def)
% Number of atoms : 162 ( 20 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 176 ( 64 ~; 75 |; 25 &)
% ( 8 <=>; 3 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 62 ( 52 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f84,plain,
$false,
inference(avatar_sat_refutation,[],[f47,f48,f74,f83]) ).
fof(f83,plain,
( ~ spl3_1
| spl3_2 ),
inference(avatar_contradiction_clause,[],[f82]) ).
fof(f82,plain,
( $false
| ~ spl3_1
| spl3_2 ),
inference(subsumption_resolution,[],[f79,f25]) ).
fof(f25,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0] : ~ member(X0,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.6IB93UcIuF/Vampire---4.8_28763',empty_set_defn) ).
fof(f79,plain,
( member(sK1(empty_set,empty_set),empty_set)
| ~ spl3_1
| spl3_2 ),
inference(backward_demodulation,[],[f75,f78]) ).
fof(f78,plain,
( empty_set = sK0
| spl3_2 ),
inference(resolution,[],[f46,f31]) ).
fof(f31,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f18]) ).
fof(f18,plain,
! [X0,X1] :
( ( not_equal(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ not_equal(X0,X1) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0,X1] :
( not_equal(X0,X1)
<=> X0 != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.6IB93UcIuF/Vampire---4.8_28763',not_equal_defn) ).
fof(f46,plain,
( ~ not_equal(sK0,empty_set)
| spl3_2 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl3_2
<=> not_equal(sK0,empty_set) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f75,plain,
( member(sK1(sK0,sK0),sK0)
| ~ spl3_1 ),
inference(resolution,[],[f41,f28]) ).
fof(f28,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( intersect(X0,X1)
| ! [X2] :
( ~ member(X2,X1)
| ~ member(X2,X0) ) )
& ( ( member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) )
| ~ intersect(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f15,f16]) ).
fof(f16,plain,
! [X0,X1] :
( ? [X3] :
( member(X3,X1)
& member(X3,X0) )
=> ( member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f15,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,[],[f14]) ).
fof(f14,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,[],[f1]) ).
fof(f1,axiom,
! [X0,X1] :
( intersect(X0,X1)
<=> ? [X2] :
( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6IB93UcIuF/Vampire---4.8_28763',intersect_defn) ).
fof(f41,plain,
( intersect(sK0,sK0)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f40,plain,
( spl3_1
<=> intersect(sK0,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f74,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f73]) ).
fof(f73,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f72,f36]) ).
fof(f36,plain,
! [X1] : ~ not_equal(X1,X1),
inference(equality_resolution,[],[f30]) ).
fof(f30,plain,
! [X0,X1] :
( X0 != X1
| ~ not_equal(X0,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f72,plain,
( not_equal(empty_set,empty_set)
| spl3_1
| ~ spl3_2 ),
inference(backward_demodulation,[],[f45,f67]) ).
fof(f67,plain,
( empty_set = sK0
| spl3_1 ),
inference(resolution,[],[f61,f42]) ).
fof(f42,plain,
( ~ intersect(sK0,sK0)
| spl3_1 ),
inference(avatar_component_clause,[],[f40]) ).
fof(f61,plain,
! [X0] :
( intersect(X0,X0)
| empty_set = X0 ),
inference(duplicate_literal_removal,[],[f60]) ).
fof(f60,plain,
! [X0] :
( intersect(X0,X0)
| empty_set = X0
| empty_set = X0 ),
inference(resolution,[],[f54,f50]) ).
fof(f50,plain,
! [X0] :
( member(sK2(X0,empty_set),X0)
| empty_set = X0 ),
inference(resolution,[],[f34,f25]) ).
fof(f34,plain,
! [X0,X1] :
( member(sK2(X0,X1),X1)
| X0 = X1
| member(sK2(X0,X1),X0) ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,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])],[f20,f21]) ).
fof(f21,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(f20,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,[],[f19]) ).
fof(f19,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,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
<=> ! [X2] :
( member(X2,X0)
<=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6IB93UcIuF/Vampire---4.8_28763',equal_member_defn) ).
fof(f54,plain,
! [X0,X1] :
( ~ member(sK2(X0,empty_set),X1)
| intersect(X1,X0)
| empty_set = X0 ),
inference(resolution,[],[f50,f29]) ).
fof(f29,plain,
! [X2,X0,X1] :
( ~ member(X2,X1)
| intersect(X0,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f45,plain,
( not_equal(sK0,empty_set)
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f48,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f23,f44,f40]) ).
fof(f23,plain,
( not_equal(sK0,empty_set)
| intersect(sK0,sK0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( ~ not_equal(sK0,empty_set)
| ~ intersect(sK0,sK0) )
& ( not_equal(sK0,empty_set)
| intersect(sK0,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f11,f12]) ).
fof(f12,plain,
( ? [X0] :
( ( ~ not_equal(X0,empty_set)
| ~ intersect(X0,X0) )
& ( not_equal(X0,empty_set)
| intersect(X0,X0) ) )
=> ( ( ~ not_equal(sK0,empty_set)
| ~ intersect(sK0,sK0) )
& ( not_equal(sK0,empty_set)
| intersect(sK0,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0] :
( ( ~ not_equal(X0,empty_set)
| ~ intersect(X0,X0) )
& ( not_equal(X0,empty_set)
| intersect(X0,X0) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f9,plain,
? [X0] :
( intersect(X0,X0)
<~> not_equal(X0,empty_set) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0] :
( intersect(X0,X0)
<=> not_equal(X0,empty_set) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0] :
( intersect(X0,X0)
<=> not_equal(X0,empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.6IB93UcIuF/Vampire---4.8_28763',prove_th110) ).
fof(f47,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f24,f44,f40]) ).
fof(f24,plain,
( ~ not_equal(sK0,empty_set)
| ~ intersect(sK0,sK0) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SET628+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.09 % 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.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 300
% 0.08/0.27 % DateTime : Fri May 3 16:57:07 EDT 2024
% 0.08/0.27 % CPUTime :
% 0.08/0.27 This is a FOF_THM_RFO_SEQ problem
% 0.08/0.27 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.6IB93UcIuF/Vampire---4.8_28763
% 0.46/0.71 % (29034)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.46/0.71 % (29036)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.46/0.71 % (29032)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.46/0.71 % (29035)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.46/0.71 % (29033)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.46/0.71 % (29037)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.46/0.71 % (29039)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.46/0.71 % (29038)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.46/0.71 % (29036)Refutation not found, incomplete strategy% (29036)------------------------------
% 0.46/0.71 % (29036)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29036)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71
% 0.46/0.71 % (29036)Memory used [KB]: 969
% 0.46/0.71 % (29036)Time elapsed: 0.002 s
% 0.46/0.71 % (29036)Instructions burned: 2 (million)
% 0.46/0.71 % (29037)Refutation not found, incomplete strategy% (29037)------------------------------
% 0.46/0.71 % (29037)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29035)Refutation not found, incomplete strategy% (29035)------------------------------
% 0.46/0.71 % (29035)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29035)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71
% 0.46/0.71 % (29035)Memory used [KB]: 968
% 0.46/0.71 % (29035)Time elapsed: 0.003 s
% 0.46/0.71 % (29035)Instructions burned: 2 (million)
% 0.46/0.71 % (29037)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71 % (29032)Refutation not found, incomplete strategy% (29032)------------------------------
% 0.46/0.71 % (29032)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29032)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71
% 0.46/0.71 % (29032)Memory used [KB]: 970
% 0.46/0.71 % (29032)Time elapsed: 0.003 s
% 0.46/0.71 % (29032)Instructions burned: 3 (million)
% 0.46/0.71
% 0.46/0.71 % (29037)Memory used [KB]: 968
% 0.46/0.71 % (29037)Time elapsed: 0.003 s
% 0.46/0.71 % (29037)Instructions burned: 2 (million)
% 0.46/0.71 % (29036)------------------------------
% 0.46/0.71 % (29036)------------------------------
% 0.46/0.71 % (29039)Refutation not found, incomplete strategy% (29039)------------------------------
% 0.46/0.71 % (29039)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29035)------------------------------
% 0.46/0.71 % (29035)------------------------------
% 0.46/0.71 % (29039)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71
% 0.46/0.71 % (29039)Memory used [KB]: 969
% 0.46/0.71 % (29039)Time elapsed: 0.003 s
% 0.46/0.71 % (29039)Instructions burned: 2 (million)
% 0.46/0.71 % (29032)------------------------------
% 0.46/0.71 % (29032)------------------------------
% 0.46/0.71 % (29037)------------------------------
% 0.46/0.71 % (29037)------------------------------
% 0.46/0.71 % (29039)------------------------------
% 0.46/0.71 % (29039)------------------------------
% 0.46/0.71 % (29038)Refutation not found, incomplete strategy% (29038)------------------------------
% 0.46/0.71 % (29038)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29038)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.71
% 0.46/0.71 % (29038)Memory used [KB]: 967
% 0.46/0.71 % (29038)Time elapsed: 0.003 s
% 0.46/0.71 % (29034)First to succeed.
% 0.46/0.71 % (29038)Instructions burned: 2 (million)
% 0.46/0.71 % (29033)Also succeeded, but the first one will report.
% 0.46/0.71 % (29038)------------------------------
% 0.46/0.71 % (29038)------------------------------
% 0.46/0.71 % (29034)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-28970"
% 0.46/0.71 % (29034)Refutation found. Thanks to Tanya!
% 0.46/0.71 % SZS status Theorem for Vampire---4
% 0.46/0.71 % SZS output start Proof for Vampire---4
% See solution above
% 0.46/0.71 % (29034)------------------------------
% 0.46/0.71 % (29034)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.71 % (29034)Termination reason: Refutation
% 0.46/0.71
% 0.46/0.71 % (29034)Memory used [KB]: 994
% 0.46/0.71 % (29034)Time elapsed: 0.004 s
% 0.46/0.71 % (29034)Instructions burned: 5 (million)
% 0.46/0.71 % (28970)Success in time 0.433 s
% 0.46/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------