TSTP Solution File: NUM393+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : NUM393+1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n020.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:57:18 EDT 2024
% Result : Theorem 0.19s 0.37s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 8 unt; 0 def)
% Number of atoms : 111 ( 0 equ)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 131 ( 56 ~; 45 |; 17 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 5 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 : 42 ( 36 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f210,plain,
$false,
inference(resolution,[],[f208,f103]) ).
fof(f103,plain,
ordinal(sK0),
inference(cnf_transformation,[],[f74]) ).
fof(f74,plain,
( ~ inclusion_comparable(sK0,sK1)
& ordinal(sK1)
& ordinal(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f47,f73,f72]) ).
fof(f72,plain,
( ? [X0] :
( ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) )
& ordinal(X0) )
=> ( ? [X1] :
( ~ inclusion_comparable(sK0,X1)
& ordinal(X1) )
& ordinal(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
( ? [X1] :
( ~ inclusion_comparable(sK0,X1)
& ordinal(X1) )
=> ( ~ inclusion_comparable(sK0,sK1)
& ordinal(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f47,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/sandbox2/benchmark/theBenchmark.p',t25_ordinal1) ).
fof(f208,plain,
~ ordinal(sK0),
inference(resolution,[],[f207,f104]) ).
fof(f104,plain,
ordinal(sK1),
inference(cnf_transformation,[],[f74]) ).
fof(f207,plain,
( ~ ordinal(sK1)
| ~ ordinal(sK0) ),
inference(duplicate_literal_removal,[],[f206]) ).
fof(f206,plain,
( ~ ordinal(sK0)
| ~ ordinal(sK1)
| ~ ordinal(sK0)
| ~ ordinal(sK1) ),
inference(resolution,[],[f199,f196]) ).
fof(f196,plain,
( ~ ordinal_subset(sK1,sK0)
| ~ ordinal(sK0)
| ~ ordinal(sK1) ),
inference(resolution,[],[f128,f174]) ).
fof(f174,plain,
~ subset(sK1,sK0),
inference(resolution,[],[f131,f171]) ).
fof(f171,plain,
~ inclusion_comparable(sK1,sK0),
inference(resolution,[],[f124,f105]) ).
fof(f105,plain,
~ inclusion_comparable(sK0,sK1),
inference(cnf_transformation,[],[f74]) ).
fof(f124,plain,
! [X0,X1] :
( inclusion_comparable(X1,X0)
| ~ inclusion_comparable(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( inclusion_comparable(X1,X0)
| ~ inclusion_comparable(X0,X1) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0,X1] :
( inclusion_comparable(X0,X1)
=> inclusion_comparable(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_r3_xboole_0) ).
fof(f131,plain,
! [X0,X1] :
( inclusion_comparable(X0,X1)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f79]) ).
fof(f79,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,[],[f78]) ).
fof(f78,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/sandbox2/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f128,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X1] :
( ( ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) )
& ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) ) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(nnf_transformation,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ( ordinal_subset(X0,X1)
<=> subset(X0,X1) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f65]) ).
fof(f65,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/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f199,plain,
( ordinal_subset(sK1,sK0)
| ~ ordinal(sK0)
| ~ ordinal(sK1) ),
inference(duplicate_literal_removal,[],[f198]) ).
fof(f198,plain,
( ~ ordinal(sK1)
| ~ ordinal(sK0)
| ordinal_subset(sK1,sK0)
| ~ ordinal(sK0)
| ~ ordinal(sK1) ),
inference(resolution,[],[f195,f127]) ).
fof(f127,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f64]) ).
fof(f64,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(flattening,[],[f63]) ).
fof(f63,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/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(f195,plain,
( ~ ordinal_subset(sK0,sK1)
| ~ ordinal(sK1)
| ~ ordinal(sK0) ),
inference(resolution,[],[f128,f173]) ).
fof(f173,plain,
~ subset(sK0,sK1),
inference(resolution,[],[f131,f105]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM393+1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.13 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 04:51:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % (29735)Running in auto input_syntax mode. Trying TPTP
% 0.19/0.36 % (29738)WARNING: value z3 for option sas not known
% 0.19/0.36 % (29736)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.19/0.36 % (29737)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.19/0.36 % (29739)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.19/0.36 % (29740)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.19/0.36 % (29738)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.19/0.36 % (29741)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.19/0.37 % (29742)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.19/0.37 TRYING [1]
% 0.19/0.37 TRYING [2]
% 0.19/0.37 TRYING [3]
% 0.19/0.37 % (29741)First to succeed.
% 0.19/0.37 TRYING [1]
% 0.19/0.37 % (29739)Also succeeded, but the first one will report.
% 0.19/0.37 % (29741)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29735"
% 0.19/0.37 TRYING [2]
% 0.19/0.37 % (29741)Refutation found. Thanks to Tanya!
% 0.19/0.37 % SZS status Theorem for theBenchmark
% 0.19/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.37 % (29741)------------------------------
% 0.19/0.37 % (29741)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.19/0.37 % (29741)Termination reason: Refutation
% 0.19/0.37
% 0.19/0.37 % (29741)Memory used [KB]: 854
% 0.19/0.37 % (29741)Time elapsed: 0.006 s
% 0.19/0.37 % (29741)Instructions burned: 6 (million)
% 0.19/0.37 % (29735)Success in time 0.01 s
%------------------------------------------------------------------------------