TSTP Solution File: SWC351+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC351+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 : n017.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:38 EDT 2022
% Result : Theorem 1.53s 0.58s
% Output : Refutation 1.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 334 ( 112 equ)
% Maximal formula atoms : 40 ( 10 avg)
% Number of connectives : 462 ( 159 ~; 133 |; 150 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 11 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 130 ( 82 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f340,plain,
$false,
inference(subsumption_resolution,[],[f339,f262]) ).
fof(f262,plain,
ssList(sK10),
inference(cnf_transformation,[],[f190]) ).
fof(f190,plain,
( ssList(sK11)
& ssList(sK12)
& ~ frontsegP(sK10,sK9)
& sK12 = sK10
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK13
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(sK13)
& strictorderedP(sK11)
& sK12 = app(sK11,sK13)
& ( nil = sK12
| nil != sK11 )
& neq(sK10,nil)
& sK11 = sK9
& ssList(sK10)
& ssList(sK9) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10,sK11,sK12,sK13])],[f155,f189,f188,f187,f186,f185]) ).
fof(f185,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,X0)
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(X1,nil)
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,sK9)
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(X1,nil)
& sK9 = X2 ) )
& ssList(X1) )
& ssList(sK9) ) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,sK9)
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(X1,nil)
& sK9 = X2 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(sK10,sK9)
& sK10 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(sK10,nil)
& sK9 = X2 ) )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f187,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(sK10,sK9)
& sK10 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(sK10,nil)
& sK9 = X2 ) )
=> ( ssList(sK11)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(sK10,sK9)
& sK10 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(sK11)
& app(sK11,X4) = X3 )
& ( nil = X3
| nil != sK11 )
& neq(sK10,nil)
& sK11 = sK9 ) ) ),
introduced(choice_axiom,[]) ).
fof(f188,plain,
( ? [X3] :
( ssList(X3)
& ~ frontsegP(sK10,sK9)
& sK10 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(sK11)
& app(sK11,X4) = X3 )
& ( nil = X3
| nil != sK11 )
& neq(sK10,nil)
& sK11 = sK9 )
=> ( ssList(sK12)
& ~ frontsegP(sK10,sK9)
& sK12 = sK10
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(sK11)
& sK12 = app(sK11,X4) )
& ( nil = sK12
| nil != sK11 )
& neq(sK10,nil)
& sK11 = sK9 ) ),
introduced(choice_axiom,[]) ).
fof(f189,plain,
( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(sK11)
& sK12 = app(sK11,X4) )
=> ( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK13
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK11 )
| ~ ssItem(X7) ) ) )
& ssList(sK13)
& strictorderedP(sK11)
& sK12 = app(sK11,sK13) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ~ frontsegP(X1,X0)
& X1 = X3
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& ssList(X4)
& strictorderedP(X2)
& app(X2,X4) = X3 )
& ( nil = X3
| nil != X2 )
& neq(X1,nil)
& X0 = X2 ) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f154]) ).
fof(f154,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ~ frontsegP(X1,X0)
& X0 = X2
& ( nil = X3
| nil != X2 )
& ? [X4] :
( app(X2,X4) = X3
& ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) ) )
& strictorderedP(X2)
& ssList(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)
=> ( ~ neq(X1,nil)
| X1 != X3
| frontsegP(X1,X0)
| X0 != X2
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) ) ) )
& ssItem(X5) )
| ~ strictorderedP(X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ~ neq(X1,nil)
| X1 != X3
| frontsegP(X1,X0)
| X0 != X2
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ssList(X6)
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) ) ) )
& ssItem(X5) )
| ~ strictorderedP(X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f339,plain,
~ ssList(sK10),
inference(subsumption_resolution,[],[f338,f268]) ).
fof(f268,plain,
ssList(sK13),
inference(cnf_transformation,[],[f190]) ).
fof(f338,plain,
( ~ ssList(sK13)
| ~ ssList(sK10) ),
inference(subsumption_resolution,[],[f337,f271]) ).
fof(f271,plain,
~ frontsegP(sK10,sK9),
inference(cnf_transformation,[],[f190]) ).
fof(f337,plain,
( frontsegP(sK10,sK9)
| ~ ssList(sK13)
| ~ ssList(sK10) ),
inference(subsumption_resolution,[],[f326,f261]) ).
fof(f261,plain,
ssList(sK9),
inference(cnf_transformation,[],[f190]) ).
fof(f326,plain,
( ~ ssList(sK9)
| ~ ssList(sK10)
| frontsegP(sK10,sK9)
| ~ ssList(sK13) ),
inference(superposition,[],[f291,f282]) ).
fof(f282,plain,
app(sK9,sK13) = sK10,
inference(definition_unfolding,[],[f266,f270,f263]) ).
fof(f263,plain,
sK11 = sK9,
inference(cnf_transformation,[],[f190]) ).
fof(f270,plain,
sK12 = sK10,
inference(cnf_transformation,[],[f190]) ).
fof(f266,plain,
sK12 = app(sK11,sK13),
inference(cnf_transformation,[],[f190]) ).
fof(f291,plain,
! [X3,X1] :
( frontsegP(app(X1,X3),X1)
| ~ ssList(X1)
| ~ ssList(app(X1,X3))
| ~ ssList(X3) ),
inference(equality_resolution,[],[f239]) ).
fof(f239,plain,
! [X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| frontsegP(X0,X1)
| app(X1,X3) != X0
| ~ ssList(X3) ),
inference(cnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ( app(X1,sK6(X0,X1)) = X0
& ssList(sK6(X0,X1)) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f174,f175]) ).
fof(f175,plain,
! [X0,X1] :
( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
=> ( app(X1,sK6(X0,X1)) = X0
& ssList(sK6(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f174,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X3] :
( app(X1,X3) != X0
| ~ ssList(X3) ) ) ) ) ),
inference(rectify,[],[f173]) ).
fof(f173,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) )
& ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) ) ) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
<=> frontsegP(X0,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC351+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_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:13:50 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.27/0.56 % (12625)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 1.53/0.56 % (12633)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)
% 1.53/0.57 % (12622)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)
% 1.53/0.57 % (12622)Instruction limit reached!
% 1.53/0.57 % (12622)------------------------------
% 1.53/0.57 % (12622)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.57 % (12622)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.57 % (12622)Termination reason: Unknown
% 1.53/0.57 % (12622)Termination phase: Naming
% 1.53/0.57
% 1.53/0.57 % (12622)Memory used [KB]: 1535
% 1.53/0.57 % (12622)Time elapsed: 0.003 s
% 1.53/0.57 % (12622)Instructions burned: 3 (million)
% 1.53/0.57 % (12622)------------------------------
% 1.53/0.57 % (12622)------------------------------
% 1.53/0.57 % (12625)First to succeed.
% 1.53/0.58 % (12646)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.53/0.58 % (12649)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)
% 1.53/0.58 % (12630)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)
% 1.53/0.58 % (12625)Refutation found. Thanks to Tanya!
% 1.53/0.58 % SZS status Theorem for theBenchmark
% 1.53/0.58 % SZS output start Proof for theBenchmark
% See solution above
% 1.53/0.58 % (12625)------------------------------
% 1.53/0.58 % (12625)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.53/0.58 % (12625)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.53/0.58 % (12625)Termination reason: Refutation
% 1.53/0.58
% 1.53/0.58 % (12625)Memory used [KB]: 1663
% 1.53/0.58 % (12625)Time elapsed: 0.147 s
% 1.53/0.58 % (12625)Instructions burned: 7 (million)
% 1.53/0.58 % (12625)------------------------------
% 1.53/0.58 % (12625)------------------------------
% 1.53/0.58 % (12619)Success in time 0.227 s
%------------------------------------------------------------------------------