TSTP Solution File: SET928+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET928+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n016.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:32 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 3 unt; 0 def)
% Number of atoms : 117 ( 28 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 134 ( 59 ~; 50 |; 17 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 39 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f76,plain,
$false,
inference(avatar_sat_refutation,[],[f49,f50,f51,f60,f66,f75]) ).
fof(f75,plain,
( spl5_2
| spl5_3
| spl5_1 ),
inference(avatar_split_clause,[],[f71,f38,f46,f42]) ).
fof(f42,plain,
( spl5_2
<=> in(sK2,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f46,plain,
( spl5_3
<=> in(sK3,sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f38,plain,
( spl5_1
<=> unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f71,plain,
( in(sK3,sK4)
| in(sK2,sK4)
| spl5_1 ),
inference(resolution,[],[f31,f68]) ).
fof(f68,plain,
( ~ disjoint(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(trivial_inequality_removal,[],[f67]) ).
fof(f67,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK2,sK3)
| ~ disjoint(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(superposition,[],[f40,f35]) ).
fof(f35,plain,
! [X0,X1] :
( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1] :
( ( disjoint(X0,X1)
| set_difference(X0,X1) != X0 )
& ( set_difference(X0,X1) = X0
| ~ disjoint(X0,X1) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( disjoint(X0,X1)
<=> set_difference(X0,X1) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.4RPA36e0Hw/Vampire---4.8_14993',t83_xboole_1) ).
fof(f40,plain,
( unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4)
| spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f31,plain,
! [X2,X0,X1] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(cnf_transformation,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( disjoint(unordered_pair(X0,X2),X1)
| in(X2,X1)
| in(X0,X1) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
~ ( ~ disjoint(unordered_pair(X0,X2),X1)
& ~ in(X2,X1)
& ~ in(X0,X1) ),
file('/export/starexec/sandbox/tmp/tmp.4RPA36e0Hw/Vampire---4.8_14993',t57_zfmisc_1) ).
fof(f66,plain,
( ~ spl5_3
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f63,f38,f46]) ).
fof(f63,plain,
( ~ in(sK3,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f53,f57]) ).
fof(f57,plain,
( disjoint(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(trivial_inequality_removal,[],[f55]) ).
fof(f55,plain,
( unordered_pair(sK2,sK3) != unordered_pair(sK2,sK3)
| disjoint(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(superposition,[],[f36,f39]) ).
fof(f39,plain,
( unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4)
| ~ spl5_1 ),
inference(avatar_component_clause,[],[f38]) ).
fof(f36,plain,
! [X0,X1] :
( set_difference(X0,X1) != X0
| disjoint(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X1,X0),X2)
| ~ in(X0,X2) ),
inference(superposition,[],[f30,f26]) ).
fof(f26,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
file('/export/starexec/sandbox/tmp/tmp.4RPA36e0Hw/Vampire---4.8_14993',commutativity_k2_tarski) ).
fof(f30,plain,
! [X2,X0,X1] :
( ~ disjoint(unordered_pair(X0,X1),X2)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ disjoint(unordered_pair(X0,X1),X2) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
~ ( in(X0,X2)
& disjoint(unordered_pair(X0,X1),X2) ),
file('/export/starexec/sandbox/tmp/tmp.4RPA36e0Hw/Vampire---4.8_14993',t55_zfmisc_1) ).
fof(f60,plain,
( ~ spl5_2
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f58,f38,f42]) ).
fof(f58,plain,
( ~ in(sK2,sK4)
| ~ spl5_1 ),
inference(resolution,[],[f57,f30]) ).
fof(f51,plain,
( spl5_1
| ~ spl5_2 ),
inference(avatar_split_clause,[],[f32,f42,f38]) ).
fof(f32,plain,
( ~ in(sK2,sK4)
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
fof(f23,plain,
( ( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK3,sK4)
& ~ in(sK2,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f21,f22]) ).
fof(f22,plain,
( ? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) )
=> ( ( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) )
& ( ( ~ in(sK3,sK4)
& ~ in(sK2,sK4) )
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(flattening,[],[f20]) ).
fof(f20,plain,
? [X0,X1,X2] :
( ( in(X1,X2)
| in(X0,X2)
| unordered_pair(X0,X1) != set_difference(unordered_pair(X0,X1),X2) )
& ( ( ~ in(X1,X2)
& ~ in(X0,X2) )
| unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f15]) ).
fof(f15,plain,
? [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<~> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,negated_conjecture,
~ ! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
inference(negated_conjecture,[],[f8]) ).
fof(f8,conjecture,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = set_difference(unordered_pair(X0,X1),X2)
<=> ( ~ in(X1,X2)
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.4RPA36e0Hw/Vampire---4.8_14993',t72_zfmisc_1) ).
fof(f50,plain,
( spl5_1
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f33,f46,f38]) ).
fof(f33,plain,
( ~ in(sK3,sK4)
| unordered_pair(sK2,sK3) = set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
fof(f49,plain,
( ~ spl5_1
| spl5_2
| spl5_3 ),
inference(avatar_split_clause,[],[f34,f46,f42,f38]) ).
fof(f34,plain,
( in(sK3,sK4)
| in(sK2,sK4)
| unordered_pair(sK2,sK3) != set_difference(unordered_pair(sK2,sK3),sK4) ),
inference(cnf_transformation,[],[f23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : SET928+1 : TPTP v8.1.2. Released v3.2.0.
% 0.09/0.12 % 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.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 17:54:11 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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.4RPA36e0Hw/Vampire---4.8_14993
% 0.61/0.80 % (15108)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.61/0.80 % (15107)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.61/0.80 % (15106)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.61/0.80 % (15104)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.61/0.80 % (15109)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.61/0.80 % (15105)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.61/0.80 % (15110)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.61/0.80 % (15111)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.61/0.80 % (15111)Refutation not found, incomplete strategy% (15111)------------------------------
% 0.61/0.80 % (15111)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15111)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (15111)Memory used [KB]: 968
% 0.61/0.80 % (15111)Time elapsed: 0.003 s
% 0.61/0.80 % (15111)Instructions burned: 2 (million)
% 0.61/0.80 % (15111)------------------------------
% 0.61/0.80 % (15111)------------------------------
% 0.61/0.80 % (15108)Refutation not found, incomplete strategy% (15108)------------------------------
% 0.61/0.80 % (15108)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15108)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (15108)Memory used [KB]: 970
% 0.61/0.80 % (15108)Time elapsed: 0.003 s
% 0.61/0.80 % (15108)Instructions burned: 2 (million)
% 0.61/0.80 % (15108)------------------------------
% 0.61/0.80 % (15108)------------------------------
% 0.61/0.80 % (15104)Refutation not found, incomplete strategy% (15104)------------------------------
% 0.61/0.80 % (15104)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15104)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (15104)Memory used [KB]: 986
% 0.61/0.80 % (15104)Time elapsed: 0.003 s
% 0.61/0.80 % (15104)Instructions burned: 3 (million)
% 0.61/0.80 % (15104)------------------------------
% 0.61/0.80 % (15104)------------------------------
% 0.61/0.80 % (15105)First to succeed.
% 0.61/0.80 % (15107)Refutation not found, incomplete strategy% (15107)------------------------------
% 0.61/0.80 % (15107)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15107)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (15107)Memory used [KB]: 989
% 0.61/0.80 % (15107)Time elapsed: 0.004 s
% 0.61/0.80 % (15107)Instructions burned: 4 (million)
% 0.61/0.80 % (15107)------------------------------
% 0.61/0.80 % (15107)------------------------------
% 0.61/0.80 % (15109)Refutation not found, incomplete strategy% (15109)------------------------------
% 0.61/0.80 % (15109)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15109)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.80
% 0.61/0.80 % (15109)Memory used [KB]: 979
% 0.61/0.80 % (15109)Time elapsed: 0.004 s
% 0.61/0.80 % (15109)Instructions burned: 3 (million)
% 0.61/0.80 % (15109)------------------------------
% 0.61/0.80 % (15109)------------------------------
% 0.61/0.80 % (15110)Also succeeded, but the first one will report.
% 0.61/0.80 % (15105)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (15105)------------------------------
% 0.61/0.80 % (15105)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.80 % (15105)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (15105)Memory used [KB]: 998
% 0.61/0.80 % (15105)Time elapsed: 0.005 s
% 0.61/0.80 % (15105)Instructions burned: 5 (million)
% 0.61/0.80 % (15105)------------------------------
% 0.61/0.80 % (15105)------------------------------
% 0.61/0.80 % (15100)Success in time 0.474 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------