TSTP Solution File: NUM393+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n025.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 : Wed Aug 31 17:59:19 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 68 ( 11 unt; 0 def)
% Number of atoms : 194 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 203 ( 77 ~; 80 |; 23 &)
% ( 11 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 60 ( 54 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f426,plain,
$false,
inference(avatar_sat_refutation,[],[f211,f229,f231,f240,f372,f391,f424]) ).
fof(f424,plain,
~ spl14_11,
inference(avatar_contradiction_clause,[],[f421]) ).
fof(f421,plain,
( $false
| ~ spl14_11 ),
inference(resolution,[],[f406,f167]) ).
fof(f167,plain,
~ inclusion_comparable(sK9,sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f114,plain,
( ordinal(sK9)
& ~ inclusion_comparable(sK9,sK10)
& ordinal(sK10) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f58,f113,f112]) ).
fof(f112,plain,
( ? [X0] :
( ordinal(X0)
& ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) ) )
=> ( ordinal(sK9)
& ? [X1] :
( ~ inclusion_comparable(sK9,X1)
& ordinal(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
( ? [X1] :
( ~ inclusion_comparable(sK9,X1)
& ordinal(X1) )
=> ( ~ inclusion_comparable(sK9,sK10)
& ordinal(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f58,plain,
? [X0] :
( ordinal(X0)
& ? [X1] :
( ~ inclusion_comparable(X0,X1)
& ordinal(X1) ) ),
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(f406,plain,
( inclusion_comparable(sK9,sK10)
| ~ spl14_11 ),
inference(resolution,[],[f390,f132]) ).
fof(f132,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| inclusion_comparable(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f90,plain,
! [X0,X1] :
( ( subset(X0,X1)
| subset(X1,X0)
| ~ inclusion_comparable(X0,X1) )
& ( inclusion_comparable(X0,X1)
| ( ~ subset(X0,X1)
& ~ subset(X1,X0) ) ) ),
inference(flattening,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( ( subset(X0,X1)
| subset(X1,X0)
| ~ inclusion_comparable(X0,X1) )
& ( inclusion_comparable(X0,X1)
| ( ~ subset(X0,X1)
& ~ subset(X1,X0) ) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f8,axiom,
! [X0,X1] :
( ( subset(X0,X1)
| subset(X1,X0) )
<=> inclusion_comparable(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_xboole_0) ).
fof(f390,plain,
( subset(sK10,sK9)
| ~ spl14_11 ),
inference(avatar_component_clause,[],[f388]) ).
fof(f388,plain,
( spl14_11
<=> subset(sK10,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_11])]) ).
fof(f391,plain,
( spl14_11
| ~ spl14_3
| ~ spl14_8
| ~ spl14_9 ),
inference(avatar_split_clause,[],[f386,f369,f226,f204,f388]) ).
fof(f204,plain,
( spl14_3
<=> ordinal(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f226,plain,
( spl14_8
<=> ordinal(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_8])]) ).
fof(f369,plain,
( spl14_9
<=> ordinal_subset(sK10,sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_9])]) ).
fof(f386,plain,
( ~ ordinal(sK10)
| ~ ordinal(sK9)
| subset(sK10,sK9)
| ~ spl14_9 ),
inference(resolution,[],[f371,f126]) ).
fof(f126,plain,
! [X0,X1] :
( ~ ordinal_subset(X0,X1)
| subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f83]) ).
fof(f83,plain,
! [X0,X1] :
( ~ ordinal(X0)
| ~ ordinal(X1)
| ( ( subset(X0,X1)
| ~ ordinal_subset(X0,X1) )
& ( ordinal_subset(X0,X1)
| ~ subset(X0,X1) ) ) ),
inference(rectify,[],[f82]) ).
fof(f82,plain,
! [X1,X0] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( ( subset(X1,X0)
| ~ ordinal_subset(X1,X0) )
& ( ordinal_subset(X1,X0)
| ~ subset(X1,X0) ) ) ),
inference(nnf_transformation,[],[f60]) ).
fof(f60,plain,
! [X1,X0] :
( ~ ordinal(X1)
| ~ ordinal(X0)
| ( subset(X1,X0)
<=> ordinal_subset(X1,X0) ) ),
inference(flattening,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( ( subset(X1,X0)
<=> ordinal_subset(X1,X0) )
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f49,plain,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( subset(X1,X0)
<=> ordinal_subset(X1,X0) ) ),
inference(rectify,[],[f24]) ).
fof(f24,axiom,
! [X1,X0] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
<=> subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_r1_ordinal1) ).
fof(f371,plain,
( ordinal_subset(sK10,sK9)
| ~ spl14_9 ),
inference(avatar_component_clause,[],[f369]) ).
fof(f372,plain,
( spl14_9
| ~ spl14_3
| ~ spl14_8 ),
inference(avatar_split_clause,[],[f365,f226,f204,f369]) ).
fof(f365,plain,
( ~ ordinal(sK10)
| ~ ordinal(sK9)
| ordinal_subset(sK10,sK9) ),
inference(resolution,[],[f283,f167]) ).
fof(f283,plain,
! [X2,X3] :
( inclusion_comparable(X2,X3)
| ordinal_subset(X3,X2)
| ~ ordinal(X3)
| ~ ordinal(X2) ),
inference(resolution,[],[f253,f133]) ).
fof(f133,plain,
! [X0,X1] :
( ~ subset(X0,X1)
| inclusion_comparable(X0,X1) ),
inference(cnf_transformation,[],[f90]) ).
fof(f253,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0)
| ~ ordinal(X1) ),
inference(duplicate_literal_removal,[],[f250]) ).
fof(f250,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ ordinal(X0)
| ~ ordinal(X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0)
| ~ ordinal(X1) ),
inference(resolution,[],[f131,f126]) ).
fof(f131,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ~ ordinal(X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ~ ordinal(X1)
| ordinal_subset(X0,X1)
| ~ ordinal(X0)
| ordinal_subset(X1,X0) ),
inference(rectify,[],[f80]) ).
fof(f80,plain,
! [X1,X0] :
( ~ ordinal(X0)
| ordinal_subset(X1,X0)
| ~ ordinal(X1)
| ordinal_subset(X0,X1) ),
inference(flattening,[],[f79]) ).
fof(f79,plain,
! [X0,X1] :
( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1)
| ~ ordinal(X1)
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f40]) ).
fof(f40,plain,
! [X0,X1] :
( ( ordinal(X1)
& ordinal(X0) )
=> ( ordinal_subset(X1,X0)
| ordinal_subset(X0,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X1,X0] :
( ( ordinal(X0)
& ordinal(X1) )
=> ( ordinal_subset(X0,X1)
| ordinal_subset(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',connectedness_r1_ordinal1) ).
fof(f240,plain,
spl14_7,
inference(avatar_contradiction_clause,[],[f239]) ).
fof(f239,plain,
( $false
| spl14_7 ),
inference(resolution,[],[f224,f193]) ).
fof(f193,plain,
epsilon_transitive(sK10),
inference(resolution,[],[f161,f166]) ).
fof(f166,plain,
ordinal(sK10),
inference(cnf_transformation,[],[f114]) ).
fof(f161,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0] :
( ( epsilon_connected(X0)
& epsilon_transitive(X0) )
| ~ ordinal(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,axiom,
! [X0] :
( ordinal(X0)
=> ( epsilon_connected(X0)
& epsilon_transitive(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_ordinal1) ).
fof(f224,plain,
( ~ epsilon_transitive(sK10)
| spl14_7 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl14_7
<=> epsilon_transitive(sK10) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_7])]) ).
fof(f231,plain,
spl14_4,
inference(avatar_contradiction_clause,[],[f230]) ).
fof(f230,plain,
( $false
| spl14_4 ),
inference(resolution,[],[f210,f194]) ).
fof(f194,plain,
epsilon_transitive(sK9),
inference(resolution,[],[f161,f168]) ).
fof(f168,plain,
ordinal(sK9),
inference(cnf_transformation,[],[f114]) ).
fof(f210,plain,
( ~ epsilon_transitive(sK9)
| spl14_4 ),
inference(avatar_component_clause,[],[f208]) ).
fof(f208,plain,
( spl14_4
<=> epsilon_transitive(sK9) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f229,plain,
( ~ spl14_7
| spl14_8 ),
inference(avatar_split_clause,[],[f201,f226,f222]) ).
fof(f201,plain,
( ordinal(sK10)
| ~ epsilon_transitive(sK10) ),
inference(resolution,[],[f136,f196]) ).
fof(f196,plain,
epsilon_connected(sK10),
inference(resolution,[],[f162,f166]) ).
fof(f162,plain,
! [X0] :
( ~ ordinal(X0)
| epsilon_connected(X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f136,plain,
! [X0] :
( ~ epsilon_connected(X0)
| ordinal(X0)
| ~ epsilon_transitive(X0) ),
inference(cnf_transformation,[],[f67]) ).
fof(f67,plain,
! [X0] :
( ordinal(X0)
| ~ epsilon_connected(X0)
| ~ epsilon_transitive(X0) ),
inference(flattening,[],[f66]) ).
fof(f66,plain,
! [X0] :
( ordinal(X0)
| ~ epsilon_connected(X0)
| ~ epsilon_transitive(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ( epsilon_connected(X0)
& epsilon_transitive(X0) )
=> ordinal(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_ordinal1) ).
fof(f211,plain,
( spl14_3
| ~ spl14_4 ),
inference(avatar_split_clause,[],[f202,f208,f204]) ).
fof(f202,plain,
( ~ epsilon_transitive(sK9)
| ordinal(sK9) ),
inference(resolution,[],[f136,f197]) ).
fof(f197,plain,
epsilon_connected(sK9),
inference(resolution,[],[f162,f168]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM393+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.34 % Computer : n025.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 : Tue Aug 30 06:37:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (23965)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.51 % (23981)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.51 % (23984)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.20/0.51 % (23973)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.51 % (23965)Refutation not found, incomplete strategy% (23965)------------------------------
% 0.20/0.51 % (23965)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (23965)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (23965)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.51
% 0.20/0.51 % (23965)Memory used [KB]: 5884
% 0.20/0.51 % (23965)Time elapsed: 0.107 s
% 0.20/0.51 % (23965)Instructions burned: 2 (million)
% 0.20/0.51 % (23965)------------------------------
% 0.20/0.51 % (23965)------------------------------
% 0.20/0.52 % (23968)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.52 % (23973)Instruction limit reached!
% 0.20/0.52 % (23973)------------------------------
% 0.20/0.52 % (23973)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (23973)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (23973)Termination reason: Unknown
% 0.20/0.52 % (23973)Termination phase: Saturation
% 0.20/0.52
% 0.20/0.52 % (23973)Memory used [KB]: 6012
% 0.20/0.52 % (23973)Time elapsed: 0.004 s
% 0.20/0.52 % (23973)Instructions burned: 3 (million)
% 0.20/0.52 % (23973)------------------------------
% 0.20/0.52 % (23973)------------------------------
% 0.20/0.52 % (23976)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.52 % (23964)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.52 % (23981)First to succeed.
% 0.20/0.52 TRYING [1]
% 0.20/0.52 % (23964)Also succeeded, but the first one will report.
% 0.20/0.52 % (23981)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (23981)------------------------------
% 0.20/0.52 % (23981)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (23981)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (23981)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (23981)Memory used [KB]: 6012
% 0.20/0.52 % (23981)Time elapsed: 0.115 s
% 0.20/0.52 % (23981)Instructions burned: 5 (million)
% 0.20/0.52 % (23981)------------------------------
% 0.20/0.52 % (23981)------------------------------
% 0.20/0.52 % (23958)Success in time 0.165 s
%------------------------------------------------------------------------------