TSTP Solution File: SWC361+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC361+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 : n024.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:42 EDT 2022
% Result : Theorem 0.21s 0.57s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 189 ( 28 equ)
% Maximal formula atoms : 30 ( 12 avg)
% Number of connectives : 253 ( 79 ~; 56 |; 106 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 11 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 45 ( 19 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f629,plain,
$false,
inference(subsumption_resolution,[],[f560,f470]) ).
fof(f470,plain,
segmentP(sK39,sK38),
inference(cnf_transformation,[],[f304]) ).
fof(f304,plain,
( ssList(sK37)
& ssList(sK39)
& strictorderedP(sK38)
& sK37 = sK39
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK39,X4)
| ~ segmentP(X4,sK38)
| ~ neq(sK38,X4)
| ~ strictorderedP(X4) )
& sK36 = sK38
& segmentP(sK39,sK38)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36)
& ssList(sK38)
& ssList(sK36) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK36,sK37,sK38,sK39])],[f131,f303,f302,f301,f300]) ).
fof(f300,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& X1 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& X0 = X2
& segmentP(X3,X2)
& neq(X1,nil)
& ~ segmentP(X1,X0) )
& ssList(X2) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& X1 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& sK36 = X2
& segmentP(X3,X2)
& neq(X1,nil)
& ~ segmentP(X1,sK36) )
& ssList(X2) ) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f301,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& X1 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& sK36 = X2
& segmentP(X3,X2)
& neq(X1,nil)
& ~ segmentP(X1,sK36) )
& ssList(X2) ) )
=> ( ssList(sK37)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& sK37 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& sK36 = X2
& segmentP(X3,X2)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f302,plain,
( ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& sK37 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& sK36 = X2
& segmentP(X3,X2)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36) )
& ssList(X2) )
=> ( ? [X3] :
( ssList(X3)
& strictorderedP(sK38)
& sK37 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK38)
| ~ neq(sK38,X4)
| ~ strictorderedP(X4) )
& sK36 = sK38
& segmentP(X3,sK38)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36) )
& ssList(sK38) ) ),
introduced(choice_axiom,[]) ).
fof(f303,plain,
( ? [X3] :
( ssList(X3)
& strictorderedP(sK38)
& sK37 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,sK38)
| ~ neq(sK38,X4)
| ~ strictorderedP(X4) )
& sK36 = sK38
& segmentP(X3,sK38)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36) )
=> ( ssList(sK39)
& strictorderedP(sK38)
& sK37 = sK39
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(sK39,X4)
| ~ segmentP(X4,sK38)
| ~ neq(sK38,X4)
| ~ strictorderedP(X4) )
& sK36 = sK38
& segmentP(sK39,sK38)
& neq(sK37,nil)
& ~ segmentP(sK37,sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ssList(X3)
& strictorderedP(X2)
& X1 = X3
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& X0 = X2
& segmentP(X3,X2)
& neq(X1,nil)
& ~ segmentP(X1,X0) )
& ssList(X2) ) )
& ssList(X0) ),
inference(flattening,[],[f130]) ).
fof(f130,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X0 = X2
& X1 = X3
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ segmentP(X3,X4)
| ~ segmentP(X4,X2)
| ~ neq(X2,X4)
| ~ strictorderedP(X4) )
& ~ segmentP(X1,X0)
& segmentP(X3,X2)
& 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)
=> ( ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ strictorderedP(X2)
| ? [X4] :
( segmentP(X3,X4)
& strictorderedP(X4)
& neq(X2,X4)
& ssList(X4)
& segmentP(X4,X2) )
| segmentP(X1,X0)
| ~ segmentP(X3,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| X0 != X2
| X1 != X3
| ~ strictorderedP(X2)
| ? [X4] :
( segmentP(X3,X4)
& strictorderedP(X4)
& neq(X2,X4)
& ssList(X4)
& segmentP(X4,X2) )
| segmentP(X1,X0)
| ~ segmentP(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f560,plain,
~ segmentP(sK39,sK38),
inference(definition_unfolding,[],[f468,f473,f471]) ).
fof(f471,plain,
sK36 = sK38,
inference(cnf_transformation,[],[f304]) ).
fof(f473,plain,
sK37 = sK39,
inference(cnf_transformation,[],[f304]) ).
fof(f468,plain,
~ segmentP(sK37,sK36),
inference(cnf_transformation,[],[f304]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC361+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n024.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:53:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.53 % (31584)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.55 % (31594)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.55 % (31605)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.55 % (31584)First to succeed.
% 0.21/0.56 % (31613)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.21/0.56 % (31595)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.57 % (31586)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.57 % (31584)Refutation found. Thanks to Tanya!
% 0.21/0.57 % SZS status Theorem for theBenchmark
% 0.21/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.57 % (31584)------------------------------
% 0.21/0.57 % (31584)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.57 % (31584)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.57 % (31584)Termination reason: Refutation
% 0.21/0.57
% 0.21/0.57 % (31584)Memory used [KB]: 6396
% 0.21/0.57 % (31584)Time elapsed: 0.116 s
% 0.21/0.57 % (31584)Instructions burned: 12 (million)
% 0.21/0.57 % (31584)------------------------------
% 0.21/0.57 % (31584)------------------------------
% 0.21/0.57 % (31583)Success in time 0.212 s
%------------------------------------------------------------------------------