TSTP Solution File: SWC269+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --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 18:42:49 EDT 2022
% Result : Theorem 1.64s 0.58s
% Output : Refutation 1.64s
% 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 : 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(f628,plain,
$false,
inference(subsumption_resolution,[],[f558,f489]) ).
fof(f489,plain,
~ totalorderedP(sK35),
inference(cnf_transformation,[],[f306]) ).
fof(f306,plain,
( ssList(sK35)
& ! [X4] :
( ~ segmentP(X4,sK37)
| ~ frontsegP(sK38,X4)
| ~ neq(sK37,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(sK37)
& sK36 = sK38
& ~ totalorderedP(sK35)
& frontsegP(sK38,sK37)
& ssList(sK38)
& sK37 = sK35
& ssList(sK37)
& ssList(sK36) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK35,sK36,sK37,sK38])],[f179,f305,f304,f303,f302]) ).
fof(f302,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& X1 = X3
& ~ totalorderedP(X0)
& frontsegP(X3,X2)
& ssList(X3)
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK35)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& X1 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,X2)
& ssList(X3)
& sK35 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f303,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& X1 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,X2)
& ssList(X3)
& sK35 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& sK36 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,X2)
& ssList(X3)
& sK35 = X2 )
& ssList(X2) )
& ssList(sK36) ) ),
introduced(choice_axiom,[]) ).
fof(f304,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& sK36 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,X2)
& ssList(X3)
& sK35 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,sK37)
| ~ frontsegP(X3,X4)
| ~ neq(sK37,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(sK37)
& sK36 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,sK37)
& ssList(X3)
& sK37 = sK35 )
& ssList(sK37) ) ),
introduced(choice_axiom,[]) ).
fof(f305,plain,
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,sK37)
| ~ frontsegP(X3,X4)
| ~ neq(sK37,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(sK37)
& sK36 = X3
& ~ totalorderedP(sK35)
& frontsegP(X3,sK37)
& ssList(X3)
& sK37 = sK35 )
=> ( ! [X4] :
( ~ segmentP(X4,sK37)
| ~ frontsegP(sK38,X4)
| ~ neq(sK37,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(sK37)
& sK36 = sK38
& ~ totalorderedP(sK35)
& frontsegP(sK38,sK37)
& ssList(sK38)
& sK37 = sK35 ) ),
introduced(choice_axiom,[]) ).
fof(f179,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& X1 = X3
& ~ totalorderedP(X0)
& frontsegP(X3,X2)
& ssList(X3)
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f178]) ).
fof(f178,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( frontsegP(X3,X2)
& X1 = X3
& totalorderedP(X2)
& X0 = X2
& ! [X4] :
( ~ segmentP(X4,X2)
| ~ frontsegP(X3,X4)
| ~ neq(X2,X4)
| ~ totalorderedP(X4)
| ~ ssList(X4) )
& ~ totalorderedP(X0)
& 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)
=> ( ~ frontsegP(X3,X2)
| X1 != X3
| ~ totalorderedP(X2)
| X0 != X2
| ? [X4] :
( frontsegP(X3,X4)
& segmentP(X4,X2)
& ssList(X4)
& neq(X2,X4)
& totalorderedP(X4) )
| totalorderedP(X0) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ frontsegP(X3,X2)
| X1 != X3
| ~ totalorderedP(X2)
| X0 != X2
| ? [X4] :
( frontsegP(X3,X4)
& segmentP(X4,X2)
& ssList(X4)
& neq(X2,X4)
& totalorderedP(X4) )
| totalorderedP(X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f558,plain,
totalorderedP(sK35),
inference(definition_unfolding,[],[f491,f486]) ).
fof(f486,plain,
sK37 = sK35,
inference(cnf_transformation,[],[f306]) ).
fof(f491,plain,
totalorderedP(sK37),
inference(cnf_transformation,[],[f306]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC269+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Aug 30 18:51:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.54 % (8987)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 1.46/0.56 % (8982)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 1.64/0.57 % (8982)First to succeed.
% 1.64/0.57 % (8979)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 1.64/0.57 % (8990)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.64/0.58 % (8997)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 1.64/0.58 % (8982)Refutation found. Thanks to Tanya!
% 1.64/0.58 % SZS status Theorem for theBenchmark
% 1.64/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.64/0.58 % (8982)------------------------------
% 1.64/0.58 % (8982)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.64/0.58 % (8982)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.64/0.58 % (8982)Termination reason: Refutation
% 1.64/0.58
% 1.64/0.58 % (8982)Memory used [KB]: 5884
% 1.64/0.58 % (8982)Time elapsed: 0.140 s
% 1.64/0.58 % (8982)Instructions burned: 12 (million)
% 1.64/0.58 % (8982)------------------------------
% 1.64/0.58 % (8982)------------------------------
% 1.64/0.58 % (8976)Success in time 0.233 s
%------------------------------------------------------------------------------