TSTP Solution File: SWC269+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC269+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 : n003.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:01 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% 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 : 17 ( 10 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 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(f226,plain,
$false,
inference(subsumption_resolution,[],[f225,f165]) ).
fof(f165,plain,
~ totalorderedP(sK1),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ssList(sK1)
& ssList(sK3)
& sK4 = sK2
& ! [X4] :
( ~ segmentP(X4,sK3)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(sK4,X4)
| ~ neq(sK3,X4) )
& totalorderedP(sK3)
& frontsegP(sK4,sK3)
& sK3 = sK1
& ~ totalorderedP(sK1)
& ssList(sK4)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f120,f134,f133,f132,f131]) ).
fof(f131,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& ~ totalorderedP(X0)
& ssList(X3) ) )
& ssList(X1) ) )
=> ( ssList(sK1)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK1 = X2
& ~ totalorderedP(sK1)
& ssList(X3) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK1 = X2
& ~ totalorderedP(sK1)
& ssList(X3) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK1 = X2
& ~ totalorderedP(sK1)
& ssList(X3) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& sK1 = X2
& ~ totalorderedP(sK1)
& ssList(X3) ) )
=> ( ssList(sK3)
& ? [X3] :
( sK2 = X3
& ! [X4] :
( ~ segmentP(X4,sK3)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(sK3,X4) )
& totalorderedP(sK3)
& frontsegP(X3,sK3)
& sK3 = sK1
& ~ totalorderedP(sK1)
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X3] :
( sK2 = X3
& ! [X4] :
( ~ segmentP(X4,sK3)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(sK3,X4) )
& totalorderedP(sK3)
& frontsegP(X3,sK3)
& sK3 = sK1
& ~ totalorderedP(sK1)
& ssList(X3) )
=> ( sK4 = sK2
& ! [X4] :
( ~ segmentP(X4,sK3)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(sK4,X4)
| ~ neq(sK3,X4) )
& totalorderedP(sK3)
& frontsegP(sK4,sK3)
& sK3 = sK1
& ~ totalorderedP(sK1)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f120,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X1 = X3
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& totalorderedP(X2)
& frontsegP(X3,X2)
& X0 = X2
& ~ totalorderedP(X0)
& ssList(X3) ) )
& ssList(X1) ) ),
inference(flattening,[],[f119]) ).
fof(f119,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ totalorderedP(X4)
| ~ ssList(X4)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4) )
& X1 = X3
& ~ totalorderedP(X0)
& totalorderedP(X2)
& frontsegP(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)
=> ( X0 != X2
| ? [X4] :
( neq(X2,X4)
& frontsegP(X3,X4)
& totalorderedP(X4)
& segmentP(X4,X2)
& ssList(X4) )
| X1 != X3
| totalorderedP(X0)
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| ? [X4] :
( neq(X2,X4)
& frontsegP(X3,X4)
& totalorderedP(X4)
& segmentP(X4,X2)
& ssList(X4) )
| X1 != X3
| totalorderedP(X0)
| ~ totalorderedP(X2)
| ~ frontsegP(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f225,plain,
totalorderedP(sK1),
inference(forward_demodulation,[],[f168,f166]) ).
fof(f166,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f135]) ).
fof(f168,plain,
totalorderedP(sK3),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Aug 30 18:42:38 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.51 % (24356)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.21/0.51 % (24353)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.51 % (24364)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.52 % (24372)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.52 % (24356)First to succeed.
% 0.21/0.53 % (24356)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 % (24356)------------------------------
% 0.21/0.53 % (24356)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (24356)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (24356)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (24356)Memory used [KB]: 6140
% 0.21/0.53 % (24356)Time elapsed: 0.004 s
% 0.21/0.53 % (24356)Instructions burned: 5 (million)
% 0.21/0.53 % (24356)------------------------------
% 0.21/0.53 % (24356)------------------------------
% 0.21/0.53 % (24352)Success in time 0.173 s
%------------------------------------------------------------------------------