TSTP Solution File: NUM393+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM393+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/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 : Tue May 21 01:41:42 EDT 2024
% Result : Theorem 0.73s 0.90s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 103 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 120 ( 52 ~; 39 |; 17 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 38 ( 32 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f105,plain,
$false,
inference(subsumption_resolution,[],[f104,f59]) ).
fof(f59,plain,
ordinal(sK0),
inference(cnf_transformation,[],[f53]) ).
fof(f53,plain,
( ~ inclusion_comparable(sK0,sK1)
& ordinal(sK1)
& ordinal(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f40,f52,f51]) ).
fof(f51,plain,
( ? [X0] :
( ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) )
& ordinal(X0) )
=> ( ? [X1] :
( ~ inclusion_comparable(sK0,X1)
& ordinal(X1) )
& ordinal(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f52,plain,
( ? [X1] :
( ~ inclusion_comparable(sK0,X1)
& ordinal(X1) )
=> ( ~ inclusion_comparable(sK0,sK1)
& ordinal(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f40,plain,
? [X0] :
( ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> inclusion_comparable(X0,X1) ) ),
inference(negated_conjecture,[],[f30]) ).
fof(f30,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> inclusion_comparable(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(f104,plain,
~ ordinal(sK0),
inference(subsumption_resolution,[],[f103,f60]) ).
fof(f60,plain,
ordinal(sK1),
inference(cnf_transformation,[],[f53]) ).
fof(f103,plain,
( ~ ordinal(sK1)
| ~ ordinal(sK0) ),
inference(subsumption_resolution,[],[f101,f94]) ).
fof(f94,plain,
~ ordinal_subset(sK0,sK1),
inference(subsumption_resolution,[],[f93,f59]) ).
fof(f93,plain,
( ~ ordinal_subset(sK0,sK1)
| ~ ordinal(sK0) ),
inference(subsumption_resolution,[],[f91,f60]) ).
fof(f91,plain,
( ~ ordinal_subset(sK0,sK1)
| ~ ordinal(sK1)
| ~ ordinal(sK0) ),
inference(resolution,[],[f63,f86]) ).
fof(f86,plain,
~ subset(sK0,sK1),
inference(resolution,[],[f75,f61]) ).
fof(f61,plain,
~ inclusion_comparable(sK0,sK1),
inference(cnf_transformation,[],[f53]) ).
fof(f75,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(flattening,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ( inclusion_comparable(X0,X1)
| ( ~ subset(X1,X0)
& ~ subset(X0,X1) ) )
& ( subset(X1,X0)
| subset(X0,X1)
| ~ inclusion_comparable(X0,X1) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
<=> ( subset(X1,X0)
| subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f63,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f54]) ).
fof(f54,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f43]) ).
fof(f43,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f101,plain,
( ordinal_subset(sK0,sK1)
| ~ ordinal(sK1)
| ~ ordinal(sK0) ),
inference(resolution,[],[f96,f68]) ).
fof(f68,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f45]) ).
fof(f45,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(f96,plain,
~ ordinal_subset(sK1,sK0),
inference(subsumption_resolution,[],[f95,f60]) ).
fof(f95,plain,
( ~ ordinal_subset(sK1,sK0)
| ~ ordinal(sK1) ),
inference(subsumption_resolution,[],[f92,f59]) ).
fof(f92,plain,
( ~ ordinal_subset(sK1,sK0)
| ~ ordinal(sK0)
| ~ ordinal(sK1) ),
inference(resolution,[],[f63,f87]) ).
fof(f87,plain,
~ subset(sK1,sK0),
inference(resolution,[],[f76,f61]) ).
fof(f76,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[],[f58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM393+1 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.14 % 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.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 04:51:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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/benchmark/theBenchmark.p
% 0.73/0.90 % (16715)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.90 % (16713)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 (2994ds/34Mi)
% 0.73/0.90 % (16716)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.90 % (16714)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 (2994ds/51Mi)
% 0.73/0.90 % (16717)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 (2994ds/34Mi)
% 0.73/0.90 % (16718)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.90 % (16719)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 (2994ds/83Mi)
% 0.73/0.90 % (16720)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 (2994ds/56Mi)
% 0.73/0.90 % (16718)Refutation not found, incomplete strategy% (16718)------------------------------
% 0.73/0.90 % (16718)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (16718)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (16718)Memory used [KB]: 969
% 0.73/0.90 % (16718)Time elapsed: 0.002 s
% 0.73/0.90 % (16718)Instructions burned: 2 (million)
% 0.73/0.90 % (16720)Refutation not found, incomplete strategy% (16720)------------------------------
% 0.73/0.90 % (16720)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (16720)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (16720)Memory used [KB]: 969
% 0.73/0.90 % (16720)Time elapsed: 0.002 s
% 0.73/0.90 % (16720)Instructions burned: 2 (million)
% 0.73/0.90 % (16716)Refutation not found, incomplete strategy% (16716)------------------------------
% 0.73/0.90 % (16716)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (16716)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (16716)Memory used [KB]: 970
% 0.73/0.90 % (16716)Time elapsed: 0.003 s
% 0.73/0.90 % (16716)Instructions burned: 2 (million)
% 0.73/0.90 % (16718)------------------------------
% 0.73/0.90 % (16718)------------------------------
% 0.73/0.90 % (16720)------------------------------
% 0.73/0.90 % (16720)------------------------------
% 0.73/0.90 % (16713)First to succeed.
% 0.73/0.90 % (16717)Refutation not found, incomplete strategy% (16717)------------------------------
% 0.73/0.90 % (16717)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (16716)------------------------------
% 0.73/0.90 % (16716)------------------------------
% 0.73/0.90 % (16717)Termination reason: Refutation not found, incomplete strategy
% 0.73/0.90
% 0.73/0.90 % (16717)Memory used [KB]: 1051
% 0.73/0.90 % (16717)Time elapsed: 0.003 s
% 0.73/0.90 % (16717)Instructions burned: 3 (million)
% 0.73/0.90 % (16717)------------------------------
% 0.73/0.90 % (16717)------------------------------
% 0.73/0.90 % (16719)Also succeeded, but the first one will report.
% 0.73/0.90 % (16713)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16711"
% 0.73/0.90 % (16715)Also succeeded, but the first one will report.
% 0.73/0.90 % (16713)Refutation found. Thanks to Tanya!
% 0.73/0.90 % SZS status Theorem for theBenchmark
% 0.73/0.90 % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.90 % (16713)------------------------------
% 0.73/0.90 % (16713)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.90 % (16713)Termination reason: Refutation
% 0.73/0.90
% 0.73/0.90 % (16713)Memory used [KB]: 985
% 0.73/0.90 % (16713)Time elapsed: 0.004 s
% 0.73/0.90 % (16713)Instructions burned: 4 (million)
% 0.73/0.90 % (16711)Success in time 0.528 s
% 0.73/0.90 % Vampire---4.8 exiting
%------------------------------------------------------------------------------