TSTP Solution File: NUM414+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM414+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 : n002.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:47 EDT 2024
% Result : Theorem 0.56s 0.73s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 83 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 94 ( 41 ~; 26 |; 16 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 35 ( 31 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f212,plain,
$false,
inference(subsumption_resolution,[],[f211,f190]) ).
fof(f190,plain,
~ ordinal_subset(sK1,sK0),
inference(unit_resulting_resolution,[],[f88,f84,f185,f116]) ).
fof(f116,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ~ ordinal_subset(X0,X1) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f31,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(f185,plain,
~ subset(sK1,sK0),
inference(unit_resulting_resolution,[],[f86,f87,f91]) ).
fof(f91,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| X0 = X1
| proper_subset(X0,X1) ),
inference(cnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( proper_subset(X0,X1)
| X0 = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,plain,
! [X0,X1] :
( ( X0 != X1
& subset(X0,X1) )
=> proper_subset(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f10]) ).
fof(f10,axiom,
! [X0,X1] :
( proper_subset(X0,X1)
<=> ( X0 != X1
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(f87,plain,
~ proper_subset(sK1,sK0),
inference(cnf_transformation,[],[f56]) ).
fof(f56,plain,
? [X0] :
( ? [X1] :
( ~ proper_subset(X1,X0)
& X0 != X1
& ~ proper_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(flattening,[],[f55]) ).
fof(f55,plain,
? [X0] :
( ? [X1] :
( ~ proper_subset(X1,X0)
& X0 != X1
& ~ proper_subset(X0,X1)
& ordinal(X1) )
& ordinal(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f39,negated_conjecture,
~ ! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ proper_subset(X1,X0)
& X0 != X1
& ~ proper_subset(X0,X1) ) ) ),
inference(negated_conjecture,[],[f38]) ).
fof(f38,conjecture,
! [X0] :
( ordinal(X0)
=> ! [X1] :
( ordinal(X1)
=> ~ ( ~ proper_subset(X1,X0)
& X0 != X1
& ~ proper_subset(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t50_ordinal1) ).
fof(f86,plain,
sK0 != sK1,
inference(cnf_transformation,[],[f56]) ).
fof(f84,plain,
ordinal(sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f88,plain,
ordinal(sK0),
inference(cnf_transformation,[],[f56]) ).
fof(f211,plain,
ordinal_subset(sK1,sK0),
inference(subsumption_resolution,[],[f196,f187]) ).
fof(f187,plain,
~ ordinal_subset(sK0,sK1),
inference(unit_resulting_resolution,[],[f84,f88,f184,f116]) ).
fof(f184,plain,
~ subset(sK0,sK1),
inference(unit_resulting_resolution,[],[f85,f86,f91]) ).
fof(f85,plain,
~ proper_subset(sK0,sK1),
inference(cnf_transformation,[],[f56]) ).
fof(f196,plain,
( ordinal_subset(sK0,sK1)
| ordinal_subset(sK1,sK0) ),
inference(resolution,[],[f165,f88]) ).
fof(f165,plain,
! [X0] :
( ~ ordinal(X0)
| ordinal_subset(X0,sK1)
| ordinal_subset(sK1,X0) ),
inference(resolution,[],[f84,f153]) ).
fof(f153,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ),
inference(cnf_transformation,[],[f81]) ).
fof(f81,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f80]) ).
fof(f80,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f9,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) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM414+1 : TPTP v8.2.0. Released v3.2.0.
% 0.11/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.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 04:32:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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.56/0.73 % (1407)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.56/0.73 % (1401)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.56/0.73 % (1403)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.73 % (1402)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.56/0.73 % (1405)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.56/0.73 % (1404)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.56/0.73 % (1406)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.56/0.73 % (1407)First to succeed.
% 0.56/0.73 % (1404)Refutation not found, incomplete strategy% (1404)------------------------------
% 0.56/0.73 % (1404)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (1404)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (1404)Memory used [KB]: 956
% 0.56/0.73 % (1404)Time elapsed: 0.002 s
% 0.56/0.73 % (1404)Instructions burned: 2 (million)
% 0.56/0.73 % (1407)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1400"
% 0.56/0.73 % (1404)------------------------------
% 0.56/0.73 % (1404)------------------------------
% 0.56/0.73 % (1406)Refutation not found, incomplete strategy% (1406)------------------------------
% 0.56/0.73 % (1406)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (1406)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (1406)Memory used [KB]: 974
% 0.56/0.73 % (1406)Time elapsed: 0.003 s
% 0.56/0.73 % (1406)Instructions burned: 2 (million)
% 0.56/0.73 % (1401)Refutation not found, incomplete strategy% (1401)------------------------------
% 0.56/0.73 % (1401)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (1401)Termination reason: Refutation not found, incomplete strategy
% 0.56/0.73
% 0.56/0.73 % (1401)Memory used [KB]: 979
% 0.56/0.73 % (1401)Time elapsed: 0.003 s
% 0.56/0.73 % (1401)Instructions burned: 3 (million)
% 0.56/0.73 % (1407)Refutation found. Thanks to Tanya!
% 0.56/0.73 % SZS status Theorem for theBenchmark
% 0.56/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.73 % (1407)------------------------------
% 0.56/0.73 % (1407)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.73 % (1407)Termination reason: Refutation
% 0.56/0.73
% 0.56/0.73 % (1407)Memory used [KB]: 1113
% 0.56/0.73 % (1407)Time elapsed: 0.003 s
% 0.56/0.73 % (1407)Instructions burned: 6 (million)
% 0.56/0.73 % (1400)Success in time 0.37 s
% 0.56/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------