TSTP Solution File: SET941+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET941+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 : n005.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:34 EDT 2024
% Result : Theorem 0.60s 0.82s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 3 unt; 0 def)
% Number of atoms : 148 ( 9 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 179 ( 66 ~; 63 |; 36 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 96 ( 77 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f82,plain,
$false,
inference(resolution,[],[f81,f43]) ).
fof(f43,plain,
~ subset(union(sK6),sK7),
inference(cnf_transformation,[],[f28]) ).
fof(f28,plain,
( ~ subset(union(sK6),sK7)
& ! [X2] :
( subset(X2,sK7)
| ~ in(X2,sK6) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f12,f27]) ).
fof(f27,plain,
( ? [X0,X1] :
( ~ subset(union(X0),X1)
& ! [X2] :
( subset(X2,X1)
| ~ in(X2,X0) ) )
=> ( ~ subset(union(sK6),sK7)
& ! [X2] :
( subset(X2,sK7)
| ~ in(X2,sK6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f12,plain,
? [X0,X1] :
( ~ subset(union(X0),X1)
& ! [X2] :
( subset(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f8]) ).
fof(f8,negated_conjecture,
~ ! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
inference(negated_conjecture,[],[f7]) ).
fof(f7,conjecture,
! [X0,X1] :
( ! [X2] :
( in(X2,X0)
=> subset(X2,X1) )
=> subset(union(X0),X1) ),
file('/export/starexec/sandbox/tmp/tmp.tlkyR8Qims/Vampire---4.8_13493',t94_zfmisc_1) ).
fof(f81,plain,
subset(union(sK6),sK7),
inference(duplicate_literal_removal,[],[f80]) ).
fof(f80,plain,
( subset(union(sK6),sK7)
| subset(union(sK6),sK7) ),
inference(resolution,[],[f76,f31]) ).
fof(f31,plain,
! [X0,X1] :
( in(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f16,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) )
=> ( ~ in(sK0(X0,X1),X1)
& in(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f14,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X3] :
( in(X3,X1)
| ~ in(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f13]) ).
fof(f13,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ in(X2,X1)
& in(X2,X0) ) )
& ( ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f11,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X1)
| ~ in(X2,X0) ) ),
inference(ennf_transformation,[],[f2]) ).
fof(f2,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( in(X2,X0)
=> in(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.tlkyR8Qims/Vampire---4.8_13493',d3_tarski) ).
fof(f76,plain,
! [X0] :
( ~ in(sK0(X0,sK7),union(sK6))
| subset(X0,sK7) ),
inference(resolution,[],[f74,f32]) ).
fof(f32,plain,
! [X0,X1] :
( ~ in(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f74,plain,
! [X0] :
( in(X0,sK7)
| ~ in(X0,union(sK6)) ),
inference(duplicate_literal_removal,[],[f68]) ).
fof(f68,plain,
! [X0] :
( ~ in(X0,union(sK6))
| ~ in(X0,union(sK6))
| in(X0,sK7) ),
inference(resolution,[],[f46,f60]) ).
fof(f60,plain,
! [X0,X1] :
( ~ in(X1,sK3(sK6,X0))
| ~ in(X0,union(sK6))
| in(X1,sK7) ),
inference(resolution,[],[f57,f30]) ).
fof(f30,plain,
! [X3,X0,X1] :
( ~ subset(X0,X1)
| ~ in(X3,X0)
| in(X3,X1) ),
inference(cnf_transformation,[],[f16]) ).
fof(f57,plain,
! [X0] :
( subset(sK3(sK6,X0),sK7)
| ~ in(X0,union(sK6)) ),
inference(resolution,[],[f45,f42]) ).
fof(f42,plain,
! [X2] :
( ~ in(X2,sK6)
| subset(X2,sK7) ),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X0,X5] :
( in(sK3(X0,X5),X0)
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f34]) ).
fof(f34,plain,
! [X0,X1,X5] :
( in(sK3(X0,X5),X0)
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f22]) ).
fof(f22,plain,
! [X0,X1] :
( ( union(X0) = X1
| ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) )
| in(sK1(X0,X1),X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f18,f21,f20,f19]) ).
fof(f19,plain,
! [X0,X1] :
( ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) )
=> ( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(sK1(X0,X1),X3) )
| ~ in(sK1(X0,X1),X1) )
& ( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
| in(sK1(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f20,plain,
! [X0,X1] :
( ? [X4] :
( in(X4,X0)
& in(sK1(X0,X1),X4) )
=> ( in(sK2(X0,X1),X0)
& in(sK1(X0,X1),sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f21,plain,
! [X0,X5] :
( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
=> ( in(sK3(X0,X5),X0)
& in(X5,sK3(X0,X5)) ) ),
introduced(choice_axiom,[]) ).
fof(f18,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X4] :
( in(X4,X0)
& in(X2,X4) )
| in(X2,X1) ) ) )
& ( ! [X5] :
( ( in(X5,X1)
| ! [X6] :
( ~ in(X6,X0)
| ~ in(X5,X6) ) )
& ( ? [X7] :
( in(X7,X0)
& in(X5,X7) )
| ~ in(X5,X1) ) )
| union(X0) != X1 ) ),
inference(rectify,[],[f17]) ).
fof(f17,plain,
! [X0,X1] :
( ( union(X0) = X1
| ? [X2] :
( ( ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) )
| ~ in(X2,X1) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ! [X3] :
( ~ in(X3,X0)
| ~ in(X2,X3) ) )
& ( ? [X3] :
( in(X3,X0)
& in(X2,X3) )
| ~ in(X2,X1) ) )
| union(X0) != X1 ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0,X1] :
( union(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> ? [X3] :
( in(X3,X0)
& in(X2,X3) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.tlkyR8Qims/Vampire---4.8_13493',d4_tarski) ).
fof(f46,plain,
! [X0,X5] :
( in(X5,sK3(X0,X5))
| ~ in(X5,union(X0)) ),
inference(equality_resolution,[],[f33]) ).
fof(f33,plain,
! [X0,X1,X5] :
( in(X5,sK3(X0,X5))
| ~ in(X5,X1)
| union(X0) != X1 ),
inference(cnf_transformation,[],[f22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET941+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/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.12/0.33 % Computer : n005.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:09:41 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.tlkyR8Qims/Vampire---4.8_13493
% 0.60/0.82 % (13608)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.82 % (13607)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.82 % (13609)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.82 % (13605)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.82 % (13610)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.82 % (13606)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.82 % (13612)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.82 % (13611)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.82 % (13610)Refutation not found, incomplete strategy% (13610)------------------------------
% 0.60/0.82 % (13610)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (13611)Refutation not found, incomplete strategy% (13611)------------------------------
% 0.60/0.82 % (13611)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (13611)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (13611)Memory used [KB]: 965
% 0.60/0.82 % (13611)Time elapsed: 0.003 s
% 0.60/0.82 % (13611)Instructions burned: 3 (million)
% 0.60/0.82 % (13611)------------------------------
% 0.60/0.82 % (13611)------------------------------
% 0.60/0.82 % (13610)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82 % (13612)Refutation not found, incomplete strategy% (13612)------------------------------
% 0.60/0.82 % (13612)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (13612)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (13612)Memory used [KB]: 974
% 0.60/0.82 % (13612)Time elapsed: 0.003 s
% 0.60/0.82 % (13612)Instructions burned: 2 (million)
% 0.60/0.82 % (13612)------------------------------
% 0.60/0.82 % (13612)------------------------------
% 0.60/0.82
% 0.60/0.82 % (13610)Memory used [KB]: 973
% 0.60/0.82 % (13610)Time elapsed: 0.003 s
% 0.60/0.82 % (13610)Instructions burned: 2 (million)
% 0.60/0.82 % (13610)------------------------------
% 0.60/0.82 % (13610)------------------------------
% 0.60/0.82 % (13606)First to succeed.
% 0.60/0.82 % (13609)Also succeeded, but the first one will report.
% 0.60/0.82 % (13606)Refutation found. Thanks to Tanya!
% 0.60/0.82 % SZS status Theorem for Vampire---4
% 0.60/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.82 % (13606)------------------------------
% 0.60/0.82 % (13606)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (13606)Termination reason: Refutation
% 0.60/0.82
% 0.60/0.82 % (13606)Memory used [KB]: 1047
% 0.60/0.82 % (13606)Time elapsed: 0.005 s
% 0.60/0.82 % (13606)Instructions burned: 5 (million)
% 0.60/0.82 % (13606)------------------------------
% 0.60/0.82 % (13606)------------------------------
% 0.60/0.82 % (13604)Success in time 0.484 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------