TSTP Solution File: SWC333+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC333+1 : TPTP v8.1.0. Released v2.4.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 : n029.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 18:40:30 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 49 ( 9 unt; 0 def)
% Number of atoms : 362 ( 28 equ)
% Maximal formula atoms : 40 ( 7 avg)
% Number of connectives : 472 ( 159 ~; 140 |; 151 &)
% ( 7 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 60 ( 23 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f719,plain,
$false,
inference(avatar_sat_refutation,[],[f320,f325,f330,f331,f336,f337,f342,f705]) ).
fof(f705,plain,
( ~ spl18_2
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6
| ~ spl18_7 ),
inference(avatar_contradiction_clause,[],[f704]) ).
fof(f704,plain,
( $false
| ~ spl18_2
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6
| ~ spl18_7 ),
inference(subsumption_resolution,[],[f703,f315]) ).
fof(f315,plain,
( totalorderedP(sK16)
| ~ spl18_2 ),
inference(avatar_component_clause,[],[f313]) ).
fof(f313,plain,
( spl18_2
<=> totalorderedP(sK16) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_2])]) ).
fof(f703,plain,
( ~ totalorderedP(sK16)
| ~ spl18_4
| ~ spl18_5
| ~ spl18_6
| ~ spl18_7 ),
inference(subsumption_resolution,[],[f702,f329]) ).
fof(f329,plain,
( ssList(sK16)
| ~ spl18_5 ),
inference(avatar_component_clause,[],[f327]) ).
fof(f327,plain,
( spl18_5
<=> ssList(sK16) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_5])]) ).
fof(f702,plain,
( ~ ssList(sK16)
| ~ totalorderedP(sK16)
| ~ spl18_4
| ~ spl18_6
| ~ spl18_7 ),
inference(subsumption_resolution,[],[f701,f335]) ).
fof(f335,plain,
( neq(sK12,sK16)
| ~ spl18_6 ),
inference(avatar_component_clause,[],[f333]) ).
fof(f333,plain,
( spl18_6
<=> neq(sK12,sK16) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_6])]) ).
fof(f701,plain,
( ~ neq(sK12,sK16)
| ~ ssList(sK16)
| ~ totalorderedP(sK16)
| ~ spl18_4
| ~ spl18_7 ),
inference(subsumption_resolution,[],[f684,f324]) ).
fof(f324,plain,
( segmentP(sK16,sK12)
| ~ spl18_4 ),
inference(avatar_component_clause,[],[f322]) ).
fof(f322,plain,
( spl18_4
<=> segmentP(sK16,sK12) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_4])]) ).
fof(f684,plain,
( ~ segmentP(sK16,sK12)
| ~ neq(sK12,sK16)
| ~ totalorderedP(sK16)
| ~ ssList(sK16)
| ~ spl18_7 ),
inference(resolution,[],[f256,f341]) ).
fof(f341,plain,
( segmentP(sK13,sK16)
| ~ spl18_7 ),
inference(avatar_component_clause,[],[f339]) ).
fof(f339,plain,
( spl18_7
<=> segmentP(sK13,sK16) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_7])]) ).
fof(f256,plain,
! [X4] :
( ~ segmentP(sK13,X4)
| ~ neq(sK12,X4)
| ~ ssList(X4)
| ~ totalorderedP(X4)
| ~ segmentP(X4,sK12) ),
inference(definition_unfolding,[],[f233,f229,f229,f223]) ).
fof(f223,plain,
sK15 = sK13,
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
( ssList(sK12)
& ssList(sK13)
& ssList(sK14)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK14)
| ~ neq(sK14,X4)
| ~ ssList(X4)
| ~ segmentP(sK15,X4) )
& totalorderedP(sK14)
& segmentP(sK15,sK14)
& ssList(sK15)
& sK14 = sK12
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ( neq(sK12,sK16)
& segmentP(sK13,sK16)
& totalorderedP(sK16)
& ssList(sK16)
& segmentP(sK16,sK12) ) )
& sK15 = sK13 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15,sK16])],[f103,f175,f174,f173,f172,f171]) ).
fof(f171,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& X0 = X2
& ( ~ segmentP(X1,X0)
| ~ totalorderedP(X0)
| ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,X0) ) )
& X1 = X3 ) ) ) )
=> ( ssList(sK12)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& sK12 = X2
& ( ~ segmentP(X1,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& X1 = X3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f172,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& sK12 = X2
& ( ~ segmentP(X1,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& X1 = X3 ) ) )
=> ( ssList(sK13)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& sK12 = X2
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& sK13 = X3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& sK12 = X2
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& sK13 = X3 ) )
=> ( ssList(sK14)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK14)
| ~ neq(sK14,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(sK14)
& segmentP(X3,sK14)
& ssList(X3)
& sK14 = sK12
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& sK13 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK14)
| ~ neq(sK14,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(sK14)
& segmentP(X3,sK14)
& ssList(X3)
& sK14 = sK12
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& sK13 = X3 )
=> ( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK14)
| ~ neq(sK14,X4)
| ~ ssList(X4)
| ~ segmentP(sK15,X4) )
& totalorderedP(sK14)
& segmentP(sK15,sK14)
& ssList(sK15)
& sK14 = sK12
& ( ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12)
| ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) ) )
& sK15 = sK13 ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X5] :
( neq(sK12,X5)
& segmentP(sK13,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,sK12) )
=> ( neq(sK12,sK16)
& segmentP(sK13,sK16)
& totalorderedP(sK16)
& ssList(sK16)
& segmentP(sK16,sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& ssList(X3)
& X0 = X2
& ( ~ segmentP(X1,X0)
| ~ totalorderedP(X0)
| ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& totalorderedP(X5)
& ssList(X5)
& segmentP(X5,X0) ) )
& X1 = X3 ) ) ) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( segmentP(X3,X2)
& X1 = X3
& ( ? [X5] :
( neq(X0,X5)
& segmentP(X1,X5)
& segmentP(X5,X0)
& totalorderedP(X5)
& ssList(X5) )
| ~ segmentP(X1,X0)
| ~ totalorderedP(X0) )
& totalorderedP(X2)
& X0 = X2
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ ssList(X4)
| ~ segmentP(X3,X4) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ segmentP(X3,X2)
| X1 != X3
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) )
| ~ totalorderedP(X2)
| X0 != X2
| ? [X4] :
( segmentP(X4,X2)
& segmentP(X3,X4)
& ssList(X4)
& neq(X2,X4)
& totalorderedP(X4) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ segmentP(X3,X2)
| X1 != X3
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X0,X5)
| ~ segmentP(X1,X5)
| ~ segmentP(X5,X0)
| ~ totalorderedP(X5) ) )
& segmentP(X1,X0)
& totalorderedP(X0) )
| ~ totalorderedP(X2)
| X0 != X2
| ? [X4] :
( segmentP(X4,X2)
& segmentP(X3,X4)
& ssList(X4)
& neq(X2,X4)
& totalorderedP(X4) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f229,plain,
sK14 = sK12,
inference(cnf_transformation,[],[f176]) ).
fof(f233,plain,
! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK14)
| ~ neq(sK14,X4)
| ~ ssList(X4)
| ~ segmentP(sK15,X4) ),
inference(cnf_transformation,[],[f176]) ).
fof(f342,plain,
( ~ spl18_3
| spl18_7
| ~ spl18_1 ),
inference(avatar_split_clause,[],[f227,f309,f339,f317]) ).
fof(f317,plain,
( spl18_3
<=> totalorderedP(sK12) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_3])]) ).
fof(f309,plain,
( spl18_1
<=> segmentP(sK13,sK12) ),
introduced(avatar_definition,[new_symbols(naming,[spl18_1])]) ).
fof(f227,plain,
( ~ segmentP(sK13,sK12)
| segmentP(sK13,sK16)
| ~ totalorderedP(sK12) ),
inference(cnf_transformation,[],[f176]) ).
fof(f337,plain,
spl18_1,
inference(avatar_split_clause,[],[f258,f309]) ).
fof(f258,plain,
segmentP(sK13,sK12),
inference(definition_unfolding,[],[f231,f223,f229]) ).
fof(f231,plain,
segmentP(sK15,sK14),
inference(cnf_transformation,[],[f176]) ).
fof(f336,plain,
( ~ spl18_3
| spl18_6
| ~ spl18_1 ),
inference(avatar_split_clause,[],[f228,f309,f333,f317]) ).
fof(f228,plain,
( ~ segmentP(sK13,sK12)
| neq(sK12,sK16)
| ~ totalorderedP(sK12) ),
inference(cnf_transformation,[],[f176]) ).
fof(f331,plain,
spl18_3,
inference(avatar_split_clause,[],[f257,f317]) ).
fof(f257,plain,
totalorderedP(sK12),
inference(definition_unfolding,[],[f232,f229]) ).
fof(f232,plain,
totalorderedP(sK14),
inference(cnf_transformation,[],[f176]) ).
fof(f330,plain,
( ~ spl18_3
| ~ spl18_1
| spl18_5 ),
inference(avatar_split_clause,[],[f225,f327,f309,f317]) ).
fof(f225,plain,
( ssList(sK16)
| ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12) ),
inference(cnf_transformation,[],[f176]) ).
fof(f325,plain,
( ~ spl18_3
| ~ spl18_1
| spl18_4 ),
inference(avatar_split_clause,[],[f224,f322,f309,f317]) ).
fof(f224,plain,
( segmentP(sK16,sK12)
| ~ segmentP(sK13,sK12)
| ~ totalorderedP(sK12) ),
inference(cnf_transformation,[],[f176]) ).
fof(f320,plain,
( ~ spl18_1
| spl18_2
| ~ spl18_3 ),
inference(avatar_split_clause,[],[f226,f317,f313,f309]) ).
fof(f226,plain,
( ~ totalorderedP(sK12)
| totalorderedP(sK16)
| ~ segmentP(sK13,sK12) ),
inference(cnf_transformation,[],[f176]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC333+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:57:42 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (5754)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.21/0.51 % (5769)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.21/0.52 % (5761)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (5754)First to succeed.
% 0.21/0.52 % (5755)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.53 % (5766)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.21/0.53 % (5754)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (5754)------------------------------
% 0.21/0.53 % (5754)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (5754)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (5754)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (5754)Memory used [KB]: 6268
% 0.21/0.53 % (5754)Time elapsed: 0.114 s
% 0.21/0.53 % (5754)Instructions burned: 9 (million)
% 0.21/0.53 % (5754)------------------------------
% 0.21/0.53 % (5754)------------------------------
% 0.21/0.53 % (5743)Success in time 0.17 s
%------------------------------------------------------------------------------