TSTP Solution File: SET909+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET909+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 : n031.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:27 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 185 ( 79 equ)
% Maximal formula atoms : 14 ( 5 avg)
% Number of connectives : 241 ( 89 ~; 92 |; 51 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 99 ( 82 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f92,plain,
$false,
inference(resolution,[],[f81,f67]) ).
fof(f67,plain,
! [X1,X4] : in(X4,unordered_pair(X4,X1)),
inference(equality_resolution,[],[f66]) ).
fof(f66,plain,
! [X2,X1,X4] :
( in(X4,X2)
| unordered_pair(X4,X1) != X2 ),
inference(equality_resolution,[],[f42]) ).
fof(f42,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| X0 != X4
| unordered_pair(X0,X1) != X2 ),
inference(cnf_transformation,[],[f26]) ).
fof(f26,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f24,f25]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) )
=> ( ( ( sK3(X0,X1,X2) != X1
& sK3(X0,X1,X2) != X0 )
| ~ in(sK3(X0,X1,X2),X2) )
& ( sK3(X0,X1,X2) = X1
| sK3(X0,X1,X2) = X0
| in(sK3(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( X1 != X4
& X0 != X4 ) )
& ( X1 = X4
| X0 = X4
| ~ in(X4,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(rectify,[],[f23]) ).
fof(f23,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(flattening,[],[f22]) ).
fof(f22,plain,
! [X0,X1,X2] :
( ( unordered_pair(X0,X1) = X2
| ? [X3] :
( ( ( X1 != X3
& X0 != X3 )
| ~ in(X3,X2) )
& ( X1 = X3
| X0 = X3
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| ( X1 != X3
& X0 != X3 ) )
& ( X1 = X3
| X0 = X3
| ~ in(X3,X2) ) )
| unordered_pair(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0,X1,X2] :
( unordered_pair(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( X1 = X3
| X0 = X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.59SqoYCiQs/Vampire---4.8_25359',d2_tarski) ).
fof(f81,plain,
! [X0] : ~ in(X0,unordered_pair(sK0,sK1)),
inference(subsumption_resolution,[],[f76,f69]) ).
fof(f69,plain,
! [X2] : ~ in(X2,empty_set),
inference(equality_resolution,[],[f51]) ).
fof(f51,plain,
! [X2,X0] :
( ~ in(X2,X0)
| empty_set != X0 ),
inference(cnf_transformation,[],[f30]) ).
fof(f30,plain,
! [X0] :
( ( empty_set = X0
| in(sK4(X0),X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f28,f29]) ).
fof(f29,plain,
! [X0] :
( ? [X1] : in(X1,X0)
=> in(sK4(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f28,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X2] : ~ in(X2,X0)
| empty_set != X0 ) ),
inference(rectify,[],[f27]) ).
fof(f27,plain,
! [X0] :
( ( empty_set = X0
| ? [X1] : in(X1,X0) )
& ( ! [X1] : ~ in(X1,X0)
| empty_set != X0 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( empty_set = X0
<=> ! [X1] : ~ in(X1,X0) ),
file('/export/starexec/sandbox/tmp/tmp.59SqoYCiQs/Vampire---4.8_25359',d1_xboole_0) ).
fof(f76,plain,
! [X0] :
( in(X0,empty_set)
| ~ in(X0,unordered_pair(sK0,sK1)) ),
inference(superposition,[],[f71,f40]) ).
fof(f40,plain,
empty_set = set_union2(unordered_pair(sK0,sK1),sK2),
inference(cnf_transformation,[],[f21]) ).
fof(f21,plain,
empty_set = set_union2(unordered_pair(sK0,sK1),sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f16,f20]) ).
fof(f20,plain,
( ? [X0,X1,X2] : empty_set = set_union2(unordered_pair(X0,X1),X2)
=> empty_set = set_union2(unordered_pair(sK0,sK1),sK2) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
? [X0,X1,X2] : empty_set = set_union2(unordered_pair(X0,X1),X2),
inference(ennf_transformation,[],[f14]) ).
fof(f14,negated_conjecture,
~ ! [X0,X1,X2] : empty_set != set_union2(unordered_pair(X0,X1),X2),
inference(negated_conjecture,[],[f13]) ).
fof(f13,conjecture,
! [X0,X1,X2] : empty_set != set_union2(unordered_pair(X0,X1),X2),
file('/export/starexec/sandbox/tmp/tmp.59SqoYCiQs/Vampire---4.8_25359',t50_zfmisc_1) ).
fof(f71,plain,
! [X0,X1,X4] :
( in(X4,set_union2(X0,X1))
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f54]) ).
fof(f54,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| ~ in(X4,X0)
| set_union2(X0,X1) != X2 ),
inference(cnf_transformation,[],[f35]) ).
fof(f35,plain,
! [X0,X1,X2] :
( ( set_union2(X0,X1) = X2
| ( ( ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) )
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| ( ~ in(X4,X1)
& ~ in(X4,X0) ) )
& ( in(X4,X1)
| in(X4,X0)
| ~ in(X4,X2) ) )
| set_union2(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f33,f34]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( ( ~ in(X3,X1)
& ~ in(X3,X0) )
| ~ in(X3,X2) )
& ( in(X3,X1)
| in(X3,X0)
| in(X3,X2) ) )
=> ( ( ( ~ in(sK5(X0,X1,X2),X1)
& ~ in(sK5(X0,X1,X2),X0) )
| ~ in(sK5(X0,X1,X2),X2) )
& ( in(sK5(X0,X1,X2),X1)
| in(sK5(X0,X1,X2),X0)
| in(sK5(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(rectify,[],[f32]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(flattening,[],[f31]) ).
fof(f31,plain,
! [X0,X1,X2] :
( ( set_union2(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_union2(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0,X1,X2] :
( set_union2(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( in(X3,X1)
| in(X3,X0) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.59SqoYCiQs/Vampire---4.8_25359',d2_xboole_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : SET909+1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11 % 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.10/0.31 % Computer : n031.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 17:50:44 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.31 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.59SqoYCiQs/Vampire---4.8_25359
% 0.60/0.78 % (25474)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.60/0.78 % (25471)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.60/0.78 % (25470)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.60/0.78 % (25468)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.60/0.78 % (25472)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.60/0.78 % (25469)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.60/0.78 % (25473)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.60/0.78 % (25475)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.60/0.78 % (25472)Refutation not found, incomplete strategy% (25472)------------------------------
% 0.60/0.78 % (25472)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (25472)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (25472)Memory used [KB]: 1038
% 0.60/0.78 % (25472)Time elapsed: 0.003 s
% 0.60/0.78 % (25472)Instructions burned: 3 (million)
% 0.60/0.78 % (25472)------------------------------
% 0.60/0.78 % (25472)------------------------------
% 0.60/0.78 % (25475)Refutation not found, incomplete strategy% (25475)------------------------------
% 0.60/0.78 % (25475)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (25475)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (25475)Memory used [KB]: 1022
% 0.60/0.78 % (25475)Time elapsed: 0.003 s
% 0.60/0.78 % (25475)Instructions burned: 3 (million)
% 0.60/0.78 % (25475)------------------------------
% 0.60/0.78 % (25475)------------------------------
% 0.60/0.78 % (25473)First to succeed.
% 0.60/0.78 % (25471)Refutation not found, incomplete strategy% (25471)------------------------------
% 0.60/0.78 % (25471)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (25471)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (25471)Memory used [KB]: 1040
% 0.60/0.78 % (25471)Time elapsed: 0.004 s
% 0.60/0.78 % (25471)Instructions burned: 3 (million)
% 0.60/0.78 % (25471)------------------------------
% 0.60/0.78 % (25471)------------------------------
% 0.60/0.78 % (25474)Also succeeded, but the first one will report.
% 0.60/0.78 % (25468)Refutation not found, incomplete strategy% (25468)------------------------------
% 0.60/0.78 % (25468)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (25468)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (25468)Memory used [KB]: 1050
% 0.60/0.78 % (25468)Time elapsed: 0.005 s
% 0.60/0.78 % (25468)Instructions burned: 7 (million)
% 0.60/0.78 % (25468)------------------------------
% 0.60/0.78 % (25468)------------------------------
% 0.60/0.78 % (25469)Also succeeded, but the first one will report.
% 0.60/0.78 % (25473)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for Vampire---4
% 0.60/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.78 % (25473)------------------------------
% 0.60/0.78 % (25473)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.78 % (25473)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (25473)Memory used [KB]: 1051
% 0.60/0.78 % (25473)Time elapsed: 0.004 s
% 0.60/0.78 % (25473)Instructions burned: 5 (million)
% 0.60/0.78 % (25473)------------------------------
% 0.60/0.78 % (25473)------------------------------
% 0.60/0.78 % (25466)Success in time 0.463 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------