TSTP Solution File: SWC291+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC291+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 : n022.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:11 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 175 ( 27 equ)
% Maximal formula atoms : 28 ( 12 avg)
% Number of connectives : 237 ( 76 ~; 54 |; 95 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 ( 19 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f308,plain,
$false,
inference(subsumption_resolution,[],[f271,f235]) ).
fof(f235,plain,
~ strictorderedP(sK3),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
( ! [X4] :
( ~ segmentP(sK6,X4)
| ~ ssList(X4)
| ~ segmentP(X4,sK5)
| ~ strictorderedP(X4)
| ~ neq(sK5,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(sK5)
& segmentP(sK6,sK5)
& sK5 = sK3
& ssList(sK6)
& sK4 = sK6
& ssList(sK5)
& ssList(sK4)
& ssList(sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f136,f175,f174,f173,f172]) ).
fof(f172,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(X0)
& strictorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(X2)
& segmentP(X3,X2)
& sK3 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) )
& ssList(X1) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f173,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(X2)
& segmentP(X3,X2)
& sK3 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(X2)
& segmentP(X3,X2)
& sK3 = X2
& ssList(X3)
& sK4 = X3 )
& ssList(X2) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(X2)
& segmentP(X3,X2)
& sK3 = X2
& ssList(X3)
& sK4 = X3 )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,sK5)
| ~ strictorderedP(X4)
| ~ neq(sK5,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(sK5)
& segmentP(X3,sK5)
& sK5 = sK3
& ssList(X3)
& sK4 = X3 )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f175,plain,
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,sK5)
| ~ strictorderedP(X4)
| ~ neq(sK5,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(sK5)
& segmentP(X3,sK5)
& sK5 = sK3
& ssList(X3)
& sK4 = X3 )
=> ( ! [X4] :
( ~ segmentP(sK6,X4)
| ~ ssList(X4)
| ~ segmentP(X4,sK5)
| ~ strictorderedP(X4)
| ~ neq(sK5,X4) )
& ~ strictorderedP(sK3)
& strictorderedP(sK5)
& segmentP(sK6,sK5)
& sK5 = sK3
& ssList(sK6)
& sK4 = sK6 ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& ~ strictorderedP(X0)
& strictorderedP(X2)
& segmentP(X3,X2)
& X0 = X2
& ssList(X3)
& X1 = X3 )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f135]) ).
fof(f135,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ strictorderedP(X0)
& X1 = X3
& segmentP(X3,X2)
& X0 = X2
& ! [X4] :
( ~ segmentP(X3,X4)
| ~ ssList(X4)
| ~ segmentP(X4,X2)
| ~ strictorderedP(X4)
| ~ neq(X2,X4) )
& strictorderedP(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)
=> ( strictorderedP(X0)
| X1 != X3
| ~ segmentP(X3,X2)
| X0 != X2
| ? [X4] :
( segmentP(X3,X4)
& strictorderedP(X4)
& segmentP(X4,X2)
& ssList(X4)
& neq(X2,X4) )
| ~ strictorderedP(X2) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( strictorderedP(X0)
| X1 != X3
| ~ segmentP(X3,X2)
| X0 != X2
| ? [X4] :
( segmentP(X3,X4)
& strictorderedP(X4)
& segmentP(X4,X2)
& ssList(X4)
& neq(X2,X4) )
| ~ strictorderedP(X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f271,plain,
strictorderedP(sK3),
inference(definition_unfolding,[],[f234,f232]) ).
fof(f232,plain,
sK5 = sK3,
inference(cnf_transformation,[],[f176]) ).
fof(f234,plain,
strictorderedP(sK5),
inference(cnf_transformation,[],[f176]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC291+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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 : n022.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 18:45:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.52 % (18324)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.53 % (18308)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.53 % (18306)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.19/0.53 % (18316)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.54 % (18314)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.19/0.54 % (18300)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.19/0.54 % (18315)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.55 % (18307)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.19/0.55 % (18306)First to succeed.
% 0.19/0.55 % (18303)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.55 % (18313)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.55 % (18307)Also succeeded, but the first one will report.
% 0.19/0.56 % (18306)Refutation found. Thanks to Tanya!
% 0.19/0.56 % SZS status Theorem for theBenchmark
% 0.19/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.56 % (18306)------------------------------
% 0.19/0.56 % (18306)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (18306)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (18306)Termination reason: Refutation
% 0.19/0.56
% 0.19/0.56 % (18306)Memory used [KB]: 6140
% 0.19/0.56 % (18306)Time elapsed: 0.124 s
% 0.19/0.56 % (18306)Instructions burned: 4 (million)
% 0.19/0.56 % (18306)------------------------------
% 0.19/0.56 % (18306)------------------------------
% 0.19/0.56 % (18299)Success in time 0.207 s
%------------------------------------------------------------------------------