TSTP Solution File: SWC398+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC398+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 : n009.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:57 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 333 ( 108 equ)
% Maximal formula atoms : 38 ( 10 avg)
% Number of connectives : 436 ( 136 ~; 109 |; 168 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 26 ( 10 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 130 ( 72 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f482,plain,
$false,
inference(subsumption_resolution,[],[f481,f215]) ).
fof(f215,plain,
~ memberP(sK3,sK4),
inference(definition_unfolding,[],[f171,f163]) ).
fof(f163,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
( ssList(sK0)
& ssList(sK2)
& ssList(sK3)
& memberP(sK0,sK4)
& ~ memberP(sK1,sK4)
& ssItem(sK4)
& ( nil != sK2
| nil = sK3 )
& sK2 = sK0
& equalelemsP(sK2)
& ssList(sK5)
& app(sK2,sK5) = sK3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5 )
| ~ ssItem(X6) )
& sK1 = sK3
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f127,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& X1 = X3 ) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& sK0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& X1 = X3 ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& sK0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& X1 = X3 ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& sK0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& sK1 = X3 ) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& sK0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& sK1 = X3 ) )
=> ( ssList(sK2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
& ( nil != sK2
| nil = X3 )
& sK2 = sK0
& ? [X5] :
( equalelemsP(sK2)
& ssList(X5)
& app(sK2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& sK1 = X3 ) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
& ( nil != sK2
| nil = X3 )
& sK2 = sK0
& ? [X5] :
( equalelemsP(sK2)
& ssList(X5)
& app(sK2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& sK1 = X3 )
=> ( ssList(sK3)
& ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
& ( nil != sK2
| nil = sK3 )
& sK2 = sK0
& ? [X5] :
( equalelemsP(sK2)
& ssList(X5)
& app(sK2,X5) = sK3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& sK1 = sK3 ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X4] :
( memberP(sK0,X4)
& ~ memberP(sK1,X4)
& ssItem(X4) )
=> ( memberP(sK0,sK4)
& ~ memberP(sK1,sK4)
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X5] :
( equalelemsP(sK2)
& ssList(X5)
& app(sK2,X5) = sK3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
=> ( equalelemsP(sK2)
& ssList(sK5)
& app(sK2,sK5) = sK3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK5 )
| ~ ssItem(X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( memberP(X0,X4)
& ~ memberP(X1,X4)
& ssItem(X4) )
& ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X5] :
( equalelemsP(X2)
& ssList(X5)
& app(X2,X5) = X3
& ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5 )
| ~ ssItem(X6) ) )
& X1 = X3 ) )
& ssList(X1) ) ),
inference(rectify,[],[f112]) ).
fof(f112,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ? [X8] :
( memberP(X0,X8)
& ~ memberP(X1,X8)
& ssItem(X8) )
& ( nil != X2
| nil = X3 )
& X0 = X2
& ? [X4] :
( equalelemsP(X2)
& ssList(X4)
& app(X2,X4) = X3
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) ) )
& X1 = X3 ) )
& ssList(X1) ) ),
inference(flattening,[],[f111]) ).
fof(f111,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& X1 = X3
& X0 = X2
& ? [X8] :
( memberP(X0,X8)
& ~ memberP(X1,X8)
& ssItem(X8) )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4 )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& 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)
=> ( ( nil = X2
& nil != X3 )
| X1 != X3
| X0 != X2
| ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X0,X8)
| memberP(X1,X8) ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 )
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| X1 != X3
| X0 != X2
| ! [X8] :
( ssItem(X8)
=> ( ~ memberP(X0,X8)
| memberP(X1,X8) ) )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssList(X7)
& app(X7,cons(X5,nil)) = X2 )
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f171,plain,
~ memberP(sK1,sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f481,plain,
memberP(sK3,sK4),
inference(forward_demodulation,[],[f476,f218]) ).
fof(f218,plain,
app(sK0,sK5) = sK3,
inference(definition_unfolding,[],[f165,f168]) ).
fof(f168,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f134]) ).
fof(f165,plain,
app(sK2,sK5) = sK3,
inference(cnf_transformation,[],[f134]) ).
fof(f476,plain,
memberP(app(sK0,sK5),sK4),
inference(resolution,[],[f276,f166]) ).
fof(f166,plain,
ssList(sK5),
inference(cnf_transformation,[],[f134]) ).
fof(f276,plain,
! [X2] :
( ~ ssList(X2)
| memberP(app(sK0,X2),sK4) ),
inference(subsumption_resolution,[],[f275,f170]) ).
fof(f170,plain,
ssItem(sK4),
inference(cnf_transformation,[],[f134]) ).
fof(f275,plain,
! [X2] :
( ~ ssList(X2)
| ~ ssItem(sK4)
| memberP(app(sK0,X2),sK4) ),
inference(subsumption_resolution,[],[f270,f175]) ).
fof(f175,plain,
ssList(sK0),
inference(cnf_transformation,[],[f134]) ).
fof(f270,plain,
! [X2] :
( ~ ssList(sK0)
| memberP(app(sK0,X2),sK4)
| ~ ssItem(sK4)
| ~ ssList(X2) ),
inference(resolution,[],[f172,f159]) ).
fof(f159,plain,
! [X2,X0,X1] :
( ~ memberP(X1,X0)
| ~ ssItem(X0)
| ~ ssList(X1)
| memberP(app(X1,X2),X0)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) ) ) ) ),
inference(flattening,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) ) ) ) ),
inference(nnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ ssItem(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssList(X2)
| ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
inference(ennf_transformation,[],[f36]) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax36) ).
fof(f172,plain,
memberP(sK0,sK4),
inference(cnf_transformation,[],[f134]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC398+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.12 % 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.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Aug 30 18:49:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.49 % (28337)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.19/0.50 % (28322)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.51 % (28337)First to succeed.
% 0.19/0.51 % (28314)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.51 % (28319)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.19/0.51 % (28324)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.19/0.51 % (28315)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.51 % (28324)Refutation not found, incomplete strategy% (28324)------------------------------
% 0.19/0.51 % (28324)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.51 % (28324)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.51 % (28324)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.51
% 0.19/0.51 % (28324)Memory used [KB]: 6140
% 0.19/0.51 % (28324)Time elapsed: 0.117 s
% 0.19/0.51 % (28324)Instructions burned: 7 (million)
% 0.19/0.51 % (28324)------------------------------
% 0.19/0.51 % (28324)------------------------------
% 0.19/0.51 % (28318)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.52 % (28337)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (28337)------------------------------
% 0.19/0.52 % (28337)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (28337)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (28337)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (28337)Memory used [KB]: 1918
% 0.19/0.52 % (28337)Time elapsed: 0.123 s
% 0.19/0.52 % (28337)Instructions burned: 15 (million)
% 0.19/0.52 % (28337)------------------------------
% 0.19/0.52 % (28337)------------------------------
% 0.19/0.52 % (28313)Success in time 0.174 s
%------------------------------------------------------------------------------