TSTP Solution File: SWC286+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC286+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:09 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of formulae : 40 ( 8 unt; 0 def)
% Number of atoms : 254 ( 87 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 300 ( 86 ~; 85 |; 112 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 59 ( 27 !; 32 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f707,plain,
$false,
inference(avatar_sat_refutation,[],[f613,f633,f660,f685,f693,f706]) ).
fof(f706,plain,
~ spl52_4,
inference(avatar_contradiction_clause,[],[f705]) ).
fof(f705,plain,
( $false
| ~ spl52_4 ),
inference(resolution,[],[f694,f443]) ).
fof(f443,plain,
strictorderedP(nil),
inference(cnf_transformation,[],[f69]) ).
fof(f69,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax69) ).
fof(f694,plain,
( ~ strictorderedP(nil)
| ~ spl52_4 ),
inference(backward_demodulation,[],[f350,f598]) ).
fof(f598,plain,
( nil = sK0
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f596,plain,
( spl52_4
<=> nil = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f350,plain,
~ strictorderedP(sK0),
inference(cnf_transformation,[],[f227]) ).
fof(f227,plain,
( ssList(sK0)
& sK1 = sK3
& ssList(sK3)
& ~ strictorderedP(sK0)
& sK2 = sK0
& ( ( ! [X5] :
( ~ ssItem(X5)
| ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5 )
& memberP(sK3,sK4)
& ssItem(sK4)
& cons(sK4,nil) = sK2 )
| ( nil = sK2
& nil = sK3 ) )
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f158,f226,f225,f224,f223,f222]) ).
fof(f222,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ~ strictorderedP(X0)
& X0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f223,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
( ? [X2] :
( ? [X3] :
( sK1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK2 = sK0
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK2 )
| ( nil = sK2
& nil = X3 ) ) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( ? [X3] :
( sK1 = X3
& ssList(X3)
& ~ strictorderedP(sK0)
& sK2 = sK0
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = sK2 )
| ( nil = sK2
& nil = X3 ) ) )
=> ( sK1 = sK3
& ssList(sK3)
& ~ strictorderedP(sK0)
& sK2 = sK0
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5 )
& memberP(sK3,X4)
& ssItem(X4)
& cons(X4,nil) = sK2 )
| ( nil = sK2
& nil = sK3 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(sK3,X5)
| X4 = X5 )
& memberP(sK3,X4)
& ssItem(X4)
& cons(X4,nil) = sK2 )
=> ( ! [X5] :
( ~ ssItem(X5)
| ~ leq(sK4,X5)
| ~ memberP(sK3,X5)
| sK4 = X5 )
& memberP(sK3,sK4)
& ssItem(sK4)
& cons(sK4,nil) = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& ssList(X3)
& ~ strictorderedP(X0)
& X0 = X2
& ( ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ~ leq(X4,X5)
| ~ memberP(X3,X5)
| X4 = X5 )
& memberP(X3,X4)
& ssItem(X4)
& cons(X4,nil) = X2 )
| ( nil = X2
& nil = X3 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& leq(X4,X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| ~ ssList(X3)
| strictorderedP(X0) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| X0 != X2
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( cons(X4,nil) != X2
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& leq(X4,X5)
& X4 != X5 )
| ~ memberP(X3,X4)
| ~ ssItem(X4) ) )
| ~ ssList(X3)
| strictorderedP(X0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f693,plain,
~ spl52_19,
inference(avatar_contradiction_clause,[],[f692]) ).
fof(f692,plain,
( $false
| ~ spl52_19 ),
inference(resolution,[],[f684,f350]) ).
fof(f684,plain,
( strictorderedP(sK0)
| ~ spl52_19 ),
inference(avatar_component_clause,[],[f682]) ).
fof(f682,plain,
( spl52_19
<=> strictorderedP(sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_19])]) ).
fof(f685,plain,
( spl52_19
| ~ spl52_11
| ~ spl52_2
| ~ spl52_7 ),
inference(avatar_split_clause,[],[f680,f610,f587,f628,f682]) ).
fof(f628,plain,
( spl52_11
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_11])]) ).
fof(f587,plain,
( spl52_2
<=> ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f610,plain,
( spl52_7
<=> cons(sK4,nil) = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f680,plain,
( ~ ssItem(sK4)
| strictorderedP(sK0)
| ~ spl52_2
| ~ spl52_7 ),
inference(superposition,[],[f588,f612]) ).
fof(f612,plain,
( cons(sK4,nil) = sK0
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f610]) ).
fof(f588,plain,
( ! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) )
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f587]) ).
fof(f660,plain,
spl52_2,
inference(avatar_split_clause,[],[f410,f587]) ).
fof(f410,plain,
! [X0] :
( ~ ssItem(X0)
| strictorderedP(cons(X0,nil)) ),
inference(cnf_transformation,[],[f217]) ).
fof(f217,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax68) ).
fof(f633,plain,
( spl52_4
| spl52_11 ),
inference(avatar_split_clause,[],[f543,f628,f596]) ).
fof(f543,plain,
( ssItem(sK4)
| nil = sK0 ),
inference(definition_unfolding,[],[f344,f349]) ).
fof(f349,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f227]) ).
fof(f344,plain,
( ssItem(sK4)
| nil = sK2 ),
inference(cnf_transformation,[],[f227]) ).
fof(f613,plain,
( spl52_7
| spl52_4 ),
inference(avatar_split_clause,[],[f544,f596,f610]) ).
fof(f544,plain,
( nil = sK0
| cons(sK4,nil) = sK0 ),
inference(definition_unfolding,[],[f342,f349,f349]) ).
fof(f342,plain,
( cons(sK4,nil) = sK2
| nil = sK2 ),
inference(cnf_transformation,[],[f227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC286+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 : n003.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:43:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (27906)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.20/0.50 % (27918)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.50 % (27910)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.20/0.50 % (27910)Instruction limit reached!
% 0.20/0.50 % (27910)------------------------------
% 0.20/0.50 % (27910)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (27910)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (27910)Termination reason: Unknown
% 0.20/0.50 % (27910)Termination phase: Preprocessing 3
% 0.20/0.50
% 0.20/0.50 % (27910)Memory used [KB]: 1535
% 0.20/0.50 % (27910)Time elapsed: 0.005 s
% 0.20/0.50 % (27910)Instructions burned: 3 (million)
% 0.20/0.50 % (27910)------------------------------
% 0.20/0.50 % (27910)------------------------------
% 0.20/0.51 % (27902)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.20/0.51 % (27918)First to succeed.
% 0.20/0.51 % (27901)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)
% 0.20/0.51 % (27902)Also succeeded, but the first one will report.
% 0.20/0.52 % (27918)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (27918)------------------------------
% 0.20/0.52 % (27918)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (27918)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (27918)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (27918)Memory used [KB]: 6396
% 0.20/0.52 % (27918)Time elapsed: 0.072 s
% 0.20/0.52 % (27918)Instructions burned: 12 (million)
% 0.20/0.52 % (27918)------------------------------
% 0.20/0.52 % (27918)------------------------------
% 0.20/0.52 % (27895)Success in time 0.167 s
%------------------------------------------------------------------------------