TSTP Solution File: SET927+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET927+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 : n028.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:09:05 EDT 2024
% Result : Theorem 0.62s 0.80s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 2 unt; 0 def)
% Number of atoms : 152 ( 60 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 177 ( 68 ~; 76 |; 25 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 32 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f73,plain,
$false,
inference(avatar_sat_refutation,[],[f36,f42,f44,f55,f72]) ).
fof(f72,plain,
( spl3_1
| ~ spl3_3 ),
inference(avatar_contradiction_clause,[],[f71]) ).
fof(f71,plain,
( $false
| spl3_1
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f70,f45]) ).
fof(f45,plain,
~ in(sK0,sK2),
inference(subsumption_resolution,[],[f16,f22]) ).
fof(f22,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
| ~ in(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f15,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(flattening,[],[f14]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) ) ),
inference(nnf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.MavDqTQ9jC/Vampire---4.8_4530',l39_zfmisc_1) ).
fof(f16,plain,
( ~ in(sK0,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) = singleton(sK0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f13,plain,
( ( ( sK0 != sK1
& ~ in(sK1,sK2) )
| in(sK0,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) )
& ( ( ( sK0 = sK1
| in(sK1,sK2) )
& ~ in(sK0,sK2) )
| set_difference(unordered_pair(sK0,sK1),sK2) = singleton(sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f11,f12]) ).
fof(f12,plain,
( ? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) )
=> ( ( ( sK0 != sK1
& ~ in(sK1,sK2) )
| in(sK0,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) )
& ( ( ( sK0 = sK1
| in(sK1,sK2) )
& ~ in(sK0,sK2) )
| set_difference(unordered_pair(sK0,sK1),sK2) = singleton(sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f11,plain,
? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) ),
inference(flattening,[],[f10]) ).
fof(f10,plain,
? [X0,X1,X2] :
( ( ( X0 != X1
& ~ in(X1,X2) )
| in(X0,X2)
| set_difference(unordered_pair(X0,X1),X2) != singleton(X0) )
& ( ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) )
| set_difference(unordered_pair(X0,X1),X2) = singleton(X0) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,plain,
? [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<~> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,negated_conjecture,
~ ! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
inference(negated_conjecture,[],[f5]) ).
fof(f5,conjecture,
! [X0,X1,X2] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
<=> ( ( X0 = X1
| in(X1,X2) )
& ~ in(X0,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.MavDqTQ9jC/Vampire---4.8_4530',t70_zfmisc_1) ).
fof(f70,plain,
( in(sK0,sK2)
| spl3_1
| ~ spl3_3 ),
inference(subsumption_resolution,[],[f67,f40]) ).
fof(f40,plain,
( in(sK1,sK2)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl3_3
<=> in(sK1,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
fof(f67,plain,
( ~ in(sK1,sK2)
| in(sK0,sK2)
| spl3_1 ),
inference(equality_resolution,[],[f57]) ).
fof(f57,plain,
( ! [X0,X1] :
( set_difference(unordered_pair(sK0,sK1),sK2) != set_difference(unordered_pair(sK0,X0),X1)
| ~ in(X0,X1)
| in(sK0,X1) )
| spl3_1 ),
inference(superposition,[],[f31,f24]) ).
fof(f24,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| ~ in(X1,X2)
| in(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f31,plain,
( set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0)
| spl3_1 ),
inference(avatar_component_clause,[],[f29]) ).
fof(f29,plain,
( spl3_1
<=> set_difference(unordered_pair(sK0,sK1),sK2) = singleton(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
fof(f55,plain,
( spl3_1
| ~ spl3_2 ),
inference(avatar_contradiction_clause,[],[f54]) ).
fof(f54,plain,
( $false
| spl3_1
| ~ spl3_2 ),
inference(subsumption_resolution,[],[f51,f45]) ).
fof(f51,plain,
( in(sK0,sK2)
| spl3_1
| ~ spl3_2 ),
inference(equality_resolution,[],[f48]) ).
fof(f48,plain,
( ! [X0] :
( set_difference(unordered_pair(sK0,sK0),sK2) != set_difference(unordered_pair(sK0,sK0),X0)
| in(sK0,X0) )
| spl3_1
| ~ spl3_2 ),
inference(superposition,[],[f46,f26]) ).
fof(f26,plain,
! [X2,X1] :
( set_difference(unordered_pair(X1,X1),X2) = singleton(X1)
| in(X1,X2) ),
inference(equality_resolution,[],[f25]) ).
fof(f25,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) = singleton(X0)
| X0 != X1
| in(X0,X2) ),
inference(cnf_transformation,[],[f15]) ).
fof(f46,plain,
( singleton(sK0) != set_difference(unordered_pair(sK0,sK0),sK2)
| spl3_1
| ~ spl3_2 ),
inference(forward_demodulation,[],[f31,f34]) ).
fof(f34,plain,
( sK0 = sK1
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f33]) ).
fof(f33,plain,
( spl3_2
<=> sK0 = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
fof(f44,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f43,f33,f39]) ).
fof(f43,plain,
( sK0 = sK1
| in(sK1,sK2) ),
inference(subsumption_resolution,[],[f17,f23]) ).
fof(f23,plain,
! [X2,X0,X1] :
( set_difference(unordered_pair(X0,X1),X2) != singleton(X0)
| in(X1,X2)
| X0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f17,plain,
( sK0 = sK1
| in(sK1,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) = singleton(sK0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f42,plain,
( ~ spl3_1
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f37,f39,f29]) ).
fof(f37,plain,
( ~ in(sK1,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) ),
inference(subsumption_resolution,[],[f18,f22]) ).
fof(f18,plain,
( ~ in(sK1,sK2)
| in(sK0,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) ),
inference(cnf_transformation,[],[f13]) ).
fof(f36,plain,
( ~ spl3_1
| ~ spl3_2 ),
inference(avatar_split_clause,[],[f27,f33,f29]) ).
fof(f27,plain,
( sK0 != sK1
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) ),
inference(subsumption_resolution,[],[f19,f22]) ).
fof(f19,plain,
( sK0 != sK1
| in(sK0,sK2)
| set_difference(unordered_pair(sK0,sK1),sK2) != singleton(sK0) ),
inference(cnf_transformation,[],[f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET927+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/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 : n028.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 : Fri May 3 16:59:07 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.16/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.MavDqTQ9jC/Vampire---4.8_4530
% 0.62/0.79 % (4645)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.79 % (4646)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.79 % (4647)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.79 % (4644)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.79 % (4642)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.79 % (4643)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.79 % (4648)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.79 % (4649)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.80 % (4646)Refutation not found, incomplete strategy% (4646)------------------------------
% 0.62/0.80 % (4646)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (4646)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (4646)Memory used [KB]: 973
% 0.62/0.80 % (4646)Time elapsed: 0.003 s
% 0.62/0.80 % (4646)Instructions burned: 3 (million)
% 0.62/0.80 % (4649)Refutation not found, incomplete strategy% (4649)------------------------------
% 0.62/0.80 % (4649)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (4649)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80
% 0.62/0.80 % (4649)Memory used [KB]: 970
% 0.62/0.80 % (4649)Time elapsed: 0.003 s
% 0.62/0.80 % (4649)Instructions burned: 3 (million)
% 0.62/0.80 % (4642)Refutation not found, incomplete strategy% (4642)------------------------------
% 0.62/0.80 % (4642)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (4642)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.80 % (4646)------------------------------
% 0.62/0.80 % (4646)------------------------------
% 0.62/0.80
% 0.62/0.80 % (4642)Memory used [KB]: 974
% 0.62/0.80 % (4642)Time elapsed: 0.004 s
% 0.62/0.80 % (4642)Instructions burned: 3 (million)
% 0.62/0.80 % (4649)------------------------------
% 0.62/0.80 % (4649)------------------------------
% 0.62/0.80 % (4642)------------------------------
% 0.62/0.80 % (4642)------------------------------
% 0.62/0.80 % (4647)First to succeed.
% 0.62/0.80 % (4643)Also succeeded, but the first one will report.
% 0.62/0.80 % (4648)Also succeeded, but the first one will report.
% 0.62/0.80 % (4645)Also succeeded, but the first one will report.
% 0.62/0.80 % (4647)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4637"
% 0.62/0.80 % (4644)Also succeeded, but the first one will report.
% 0.62/0.80 % (4647)Refutation found. Thanks to Tanya!
% 0.62/0.80 % SZS status Theorem for Vampire---4
% 0.62/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.80 % (4647)------------------------------
% 0.62/0.80 % (4647)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.80 % (4647)Termination reason: Refutation
% 0.62/0.80
% 0.62/0.80 % (4647)Memory used [KB]: 992
% 0.62/0.80 % (4647)Time elapsed: 0.005 s
% 0.62/0.80 % (4647)Instructions burned: 5 (million)
% 0.62/0.80 % (4637)Success in time 0.477 s
% 0.62/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------