TSTP Solution File: SET988+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET988+1 : TPTP v8.2.0. 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.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 : Tue May 21 03:14:12 EDT 2024
% Result : Theorem 0.45s 0.66s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 10
% Syntax : Number of formulae : 48 ( 4 unt; 0 def)
% Number of atoms : 184 ( 51 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 217 ( 81 ~; 72 |; 45 &)
% ( 7 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 1 con; 0-2 aty)
% Number of variables : 140 ( 107 !; 33 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f136,plain,
$false,
inference(avatar_sat_refutation,[],[f100,f114,f135]) ).
fof(f135,plain,
spl14_2,
inference(avatar_contradiction_clause,[],[f134]) ).
fof(f134,plain,
( $false
| spl14_2 ),
inference(subsumption_resolution,[],[f133,f99]) ).
fof(f99,plain,
( ~ function(sK0)
| spl14_2 ),
inference(avatar_component_clause,[],[f97]) ).
fof(f97,plain,
( spl14_2
<=> function(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f133,plain,
( function(sK0)
| spl14_2 ),
inference(trivial_inequality_removal,[],[f132]) ).
fof(f132,plain,
( sK9(sK0) != sK9(sK0)
| function(sK0)
| spl14_2 ),
inference(superposition,[],[f84,f130]) ).
fof(f130,plain,
( sK10(sK0) = sK9(sK0)
| spl14_2 ),
inference(subsumption_resolution,[],[f129,f99]) ).
fof(f129,plain,
( sK10(sK0) = sK9(sK0)
| function(sK0)
| spl14_2 ),
inference(resolution,[],[f126,f82]) ).
fof(f82,plain,
! [X0] :
( in(ordered_pair(sK8(X0),sK9(X0)),X0)
| function(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0] :
( ( function(X0)
| ( sK9(X0) != sK10(X0)
& in(ordered_pair(sK8(X0),sK10(X0)),X0)
& in(ordered_pair(sK8(X0),sK9(X0)),X0) ) )
& ( ! [X4,X5,X6] :
( X5 = X6
| ~ in(ordered_pair(X4,X6),X0)
| ~ in(ordered_pair(X4,X5),X0) )
| ~ function(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8,sK9,sK10])],[f59,f60]) ).
fof(f60,plain,
! [X0] :
( ? [X1,X2,X3] :
( X2 != X3
& in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> ( sK9(X0) != sK10(X0)
& in(ordered_pair(sK8(X0),sK10(X0)),X0)
& in(ordered_pair(sK8(X0),sK9(X0)),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f59,plain,
! [X0] :
( ( function(X0)
| ? [X1,X2,X3] :
( X2 != X3
& in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) ) )
& ( ! [X4,X5,X6] :
( X5 = X6
| ~ in(ordered_pair(X4,X6),X0)
| ~ in(ordered_pair(X4,X5),X0) )
| ~ function(X0) ) ),
inference(rectify,[],[f58]) ).
fof(f58,plain,
! [X0] :
( ( function(X0)
| ? [X1,X2,X3] :
( X2 != X3
& in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) ) )
& ( ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
| ~ function(X0) ) ),
inference(nnf_transformation,[],[f42]) ).
fof(f42,plain,
! [X0] :
( function(X0)
<=> ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) ) ),
inference(flattening,[],[f41]) ).
fof(f41,plain,
! [X0] :
( function(X0)
<=> ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) ) ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,axiom,
! [X0] :
( function(X0)
<=> ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> X2 = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_funct_1) ).
fof(f126,plain,
( ! [X0] :
( ~ in(ordered_pair(sK8(sK0),X0),sK0)
| sK10(sK0) = X0 )
| spl14_2 ),
inference(subsumption_resolution,[],[f121,f99]) ).
fof(f121,plain,
! [X0] :
( sK10(sK0) = X0
| ~ in(ordered_pair(sK8(sK0),X0),sK0)
| function(sK0) ),
inference(resolution,[],[f69,f83]) ).
fof(f83,plain,
! [X0] :
( in(ordered_pair(sK8(X0),sK10(X0)),X0)
| function(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f69,plain,
! [X2,X3,X1] :
( ~ in(ordered_pair(X1,X3),sK0)
| X2 = X3
| ~ in(ordered_pair(X1,X2),sK0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f48,plain,
( ( ~ function(sK0)
| ~ relation(sK0) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),sK0)
| ~ in(ordered_pair(X1,X2),sK0) )
& ! [X4] :
( ordered_pair(sK1(X4),sK2(X4)) = X4
| ~ in(X4,sK0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f37,f47,f46]) ).
fof(f46,plain,
( ? [X0] :
( ( ~ function(X0)
| ~ relation(X0) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X0) ) )
=> ( ( ~ function(sK0)
| ~ relation(sK0) )
& ! [X3,X2,X1] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),sK0)
| ~ in(ordered_pair(X1,X2),sK0) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,sK0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f47,plain,
! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
=> ordered_pair(sK1(X4),sK2(X4)) = X4 ),
introduced(choice_axiom,[]) ).
fof(f37,plain,
? [X0] :
( ( ~ function(X0)
| ~ relation(X0) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X0) ) ),
inference(flattening,[],[f36]) ).
fof(f36,plain,
? [X0] :
( ( ~ function(X0)
| ~ relation(X0) )
& ! [X1,X2,X3] :
( X2 = X3
| ~ in(ordered_pair(X1,X3),X0)
| ~ in(ordered_pair(X1,X2),X0) )
& ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X0) ) ),
inference(ennf_transformation,[],[f35]) ).
fof(f35,plain,
~ ! [X0] :
( ( ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> X2 = X3 )
& ! [X4] :
~ ( ! [X5,X6] : ordered_pair(X5,X6) != X4
& in(X4,X0) ) )
=> ( function(X0)
& relation(X0) ) ),
inference(rectify,[],[f32]) ).
fof(f32,negated_conjecture,
~ ! [X0] :
( ( ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> X2 = X3 )
& ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) )
=> ( function(X0)
& relation(X0) ) ),
inference(negated_conjecture,[],[f31]) ).
fof(f31,conjecture,
! [X0] :
( ( ! [X1,X2,X3] :
( ( in(ordered_pair(X1,X3),X0)
& in(ordered_pair(X1,X2),X0) )
=> X2 = X3 )
& ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) )
=> ( function(X0)
& relation(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_funct_1) ).
fof(f84,plain,
! [X0] :
( sK9(X0) != sK10(X0)
| function(X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f114,plain,
spl14_1,
inference(avatar_split_clause,[],[f111,f93]) ).
fof(f93,plain,
( spl14_1
<=> relation(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f111,plain,
relation(sK0),
inference(duplicate_literal_removal,[],[f110]) ).
fof(f110,plain,
( relation(sK0)
| relation(sK0) ),
inference(resolution,[],[f109,f78]) ).
fof(f78,plain,
! [X0] :
( in(sK5(X0),X0)
| relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f57,plain,
! [X0] :
( ( relation(X0)
| ( ! [X2,X3] : ordered_pair(X2,X3) != sK5(X0)
& in(sK5(X0),X0) ) )
& ( ! [X4] :
( ordered_pair(sK6(X4),sK7(X4)) = X4
| ~ in(X4,X0) )
| ~ relation(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f54,f56,f55]) ).
fof(f55,plain,
! [X0] :
( ? [X1] :
( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) )
=> ( ! [X3,X2] : ordered_pair(X2,X3) != sK5(X0)
& in(sK5(X0),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f56,plain,
! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
=> ordered_pair(sK6(X4),sK7(X4)) = X4 ),
introduced(choice_axiom,[]) ).
fof(f54,plain,
! [X0] :
( ( relation(X0)
| ? [X1] :
( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) )
& ( ! [X4] :
( ? [X5,X6] : ordered_pair(X5,X6) = X4
| ~ in(X4,X0) )
| ~ relation(X0) ) ),
inference(rectify,[],[f53]) ).
fof(f53,plain,
! [X0] :
( ( relation(X0)
| ? [X1] :
( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) )
& ( ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) )
| ~ relation(X0) ) ),
inference(nnf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0] :
( relation(X0)
<=> ! [X1] :
( ? [X2,X3] : ordered_pair(X2,X3) = X1
| ~ in(X1,X0) ) ),
inference(ennf_transformation,[],[f34]) ).
fof(f34,axiom,
! [X0] :
( relation(X0)
<=> ! [X1] :
~ ( ! [X2,X3] : ordered_pair(X2,X3) != X1
& in(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_relat_1) ).
fof(f109,plain,
! [X0] :
( ~ in(sK5(X0),sK0)
| relation(X0) ),
inference(equality_resolution,[],[f104]) ).
fof(f104,plain,
! [X0,X1] :
( sK5(X1) != X0
| relation(X1)
| ~ in(X0,sK0) ),
inference(superposition,[],[f79,f68]) ).
fof(f68,plain,
! [X4] :
( ordered_pair(sK1(X4),sK2(X4)) = X4
| ~ in(X4,sK0) ),
inference(cnf_transformation,[],[f48]) ).
fof(f79,plain,
! [X2,X3,X0] :
( ordered_pair(X2,X3) != sK5(X0)
| relation(X0) ),
inference(cnf_transformation,[],[f57]) ).
fof(f100,plain,
( ~ spl14_1
| ~ spl14_2 ),
inference(avatar_split_clause,[],[f70,f97,f93]) ).
fof(f70,plain,
( ~ function(sK0)
| ~ relation(sK0) ),
inference(cnf_transformation,[],[f48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SET988+1 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.10 % 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.09/0.30 % Computer : n014.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon May 20 12:27:37 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a FOF_THM_RFO_SEQ problem
% 0.09/0.30 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/benchmark/theBenchmark.p
% 0.45/0.66 % (6078)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 theBenchmark for (2996ds/83Mi)
% 0.45/0.66 % (6073)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 theBenchmark for (2996ds/51Mi)
% 0.45/0.66 % (6072)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 theBenchmark for (2996ds/34Mi)
% 0.45/0.66 % (6074)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.45/0.66 % (6075)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.45/0.66 % (6076)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 theBenchmark for (2996ds/34Mi)
% 0.45/0.66 % (6077)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.45/0.66 % (6079)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.45/0.66 % (6077)First to succeed.
% 0.45/0.66 % (6075)Also succeeded, but the first one will report.
% 0.45/0.66 % (6076)Also succeeded, but the first one will report.
% 0.45/0.66 % (6079)Also succeeded, but the first one will report.
% 0.45/0.66 % (6077)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-6071"
% 0.45/0.66 % (6078)Also succeeded, but the first one will report.
% 0.45/0.66 % (6072)Refutation not found, incomplete strategy% (6072)------------------------------
% 0.45/0.66 % (6072)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.45/0.66 % (6072)Termination reason: Refutation not found, incomplete strategy
% 0.45/0.66
% 0.45/0.66 % (6072)Memory used [KB]: 1082
% 0.45/0.66 % (6072)Time elapsed: 0.006 s
% 0.45/0.66 % (6072)Instructions burned: 8 (million)
% 0.45/0.66 % (6077)Refutation found. Thanks to Tanya!
% 0.45/0.66 % SZS status Theorem for theBenchmark
% 0.45/0.66 % SZS output start Proof for theBenchmark
% See solution above
% 0.45/0.67 % (6077)------------------------------
% 0.45/0.67 % (6077)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.45/0.67 % (6077)Termination reason: Refutation
% 0.45/0.67
% 0.45/0.67 % (6077)Memory used [KB]: 1069
% 0.45/0.67 % (6077)Time elapsed: 0.005 s
% 0.45/0.67 % (6077)Instructions burned: 6 (million)
% 0.45/0.67 % (6071)Success in time 0.362 s
% 0.45/0.67 % Vampire---4.8 exiting
%------------------------------------------------------------------------------