TSTP Solution File: SWC189+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC189+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 : n028.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:39:27 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 9 unt; 0 def)
% Number of atoms : 335 ( 120 equ)
% Maximal formula atoms : 36 ( 10 avg)
% Number of connectives : 424 ( 120 ~; 97 |; 175 &)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 10 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 180 ( 80 !; 100 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f195,plain,
$false,
inference(subsumption_resolution,[],[f194,f162]) ).
fof(f162,plain,
sK9 != sK8,
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
( ssList(sK4)
& ssList(sK5)
& ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK6 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(sK7)
& sK6 = sK4
& sK7 = sK5
& ssItem(sK8)
& ssItem(sK9)
& ssList(sK11)
& app(app(app(sK10,cons(sK8,nil)),cons(sK9,nil)),sK11) = sK4
& sK9 != sK8
& ssList(sK10)
& ssList(sK6) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7,sK8,sK9,sK10,sK11])],[f127,f135,f134,f133,f132,f131,f130,f129,f128]) ).
fof(f128,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X0
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) ) ) )
=> ( ssList(sK4)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK4 = X2
& X1 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK4 = X2
& X1 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) ) )
=> ( ssList(sK5)
& ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK4 = X2
& sK5 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f130,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK4 = X2
& sK5 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK6 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK6 = sK4
& sK5 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK6 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& sK6 = sK4
& sK5 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) )
=> ( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK6 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(sK7)
& sK6 = sK4
& sK7 = sK5
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = sK4
& X8 != X9 )
& ssList(X10) ) ) )
=> ( ssItem(sK8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(sK8,nil)),cons(X9,nil)),X11) = sK4
& sK8 != X9 )
& ssList(X10) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(sK8,nil)),cons(X9,nil)),X11) = sK4
& sK8 != X9 )
& ssList(X10) ) )
=> ( ssItem(sK9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(sK8,nil)),cons(sK9,nil)),X11) = sK4
& sK9 != sK8 )
& ssList(X10) ) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(sK8,nil)),cons(sK9,nil)),X11) = sK4
& sK9 != sK8 )
& ssList(X10) )
=> ( ? [X11] :
( ssList(X11)
& app(app(app(sK10,cons(sK8,nil)),cons(sK9,nil)),X11) = sK4
& sK9 != sK8 )
& ssList(sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X11] :
( ssList(X11)
& app(app(app(sK10,cons(sK8,nil)),cons(sK9,nil)),X11) = sK4
& sK9 != sK8 )
=> ( ssList(sK11)
& app(app(app(sK10,cons(sK8,nil)),cons(sK9,nil)),sK11) = sK4
& sK9 != sK8 ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ~ ssItem(X5)
| ! [X6] :
( ! [X7] :
( ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X2 )
| ~ ssList(X6) ) )
| ~ ssItem(X4) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssItem(X9)
& ? [X10] :
( ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X0
& X8 != X9 )
& ssList(X10) ) ) ) )
& ssList(X2) ) ) ),
inference(rectify,[],[f105]) ).
fof(f105,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ? [X3] :
( ! [X8] :
( ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2 )
| ~ ssList(X10) ) )
| ~ ssItem(X8) )
& ssList(X3)
& X0 = X2
& X1 = X3
& ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( ssList(X7)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& X4 != X5 )
& ssList(X6) ) ) ) )
& ssList(X2) ) ) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( X4 != X5
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X0
& ssList(X7) )
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
& X0 = X2
& X1 = X3
& ! [X8] :
( ! [X9] :
( ~ ssItem(X9)
| ! [X10] :
( ! [X11] :
( ~ ssList(X11)
| X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X2 )
| ~ ssList(X10) ) )
| ~ ssItem(X8) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssItem(X5)
=> ! [X6] :
( ssList(X6)
=> ! [X7] :
( ssList(X7)
=> ( X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != X0 ) ) ) ) )
| X0 != X2
| X1 != X3
| ? [X8] :
( ssItem(X8)
& ? [X9] :
( ? [X10] :
( ssList(X10)
& ? [X11] :
( ssList(X11)
& app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) = X2
& X8 != X9 ) )
& ssItem(X9) ) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0 ) ) ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( X4 != X5
& ssList(X7)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2 )
& ssList(X6) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssItem(X9)
=> ! [X10] :
( ssList(X10)
=> ! [X11] :
( ssList(X11)
=> ( X8 = X9
| app(app(app(X10,cons(X8,nil)),cons(X9,nil)),X11) != X0 ) ) ) ) )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssItem(X5)
& ? [X6] :
( ? [X7] :
( X4 != X5
& ssList(X7)
& app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) = X2 )
& ssList(X6) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f194,plain,
sK9 = sK8,
inference(subsumption_resolution,[],[f193,f165]) ).
fof(f165,plain,
ssItem(sK9),
inference(cnf_transformation,[],[f136]) ).
fof(f193,plain,
( ~ ssItem(sK9)
| sK9 = sK8 ),
inference(subsumption_resolution,[],[f192,f164]) ).
fof(f164,plain,
ssList(sK11),
inference(cnf_transformation,[],[f136]) ).
fof(f192,plain,
( ~ ssList(sK11)
| sK9 = sK8
| ~ ssItem(sK9) ),
inference(subsumption_resolution,[],[f191,f166]) ).
fof(f166,plain,
ssItem(sK8),
inference(cnf_transformation,[],[f136]) ).
fof(f191,plain,
( ~ ssItem(sK8)
| sK9 = sK8
| ~ ssList(sK11)
| ~ ssItem(sK9) ),
inference(subsumption_resolution,[],[f190,f161]) ).
fof(f161,plain,
ssList(sK10),
inference(cnf_transformation,[],[f136]) ).
fof(f190,plain,
( ~ ssList(sK10)
| sK9 = sK8
| ~ ssList(sK11)
| ~ ssItem(sK9)
| ~ ssItem(sK8) ),
inference(trivial_inequality_removal,[],[f189]) ).
fof(f189,plain,
( ~ ssList(sK11)
| sK9 = sK8
| ~ ssItem(sK8)
| sK4 != sK4
| ~ ssItem(sK9)
| ~ ssList(sK10) ),
inference(superposition,[],[f173,f163]) ).
fof(f163,plain,
app(app(app(sK10,cons(sK8,nil)),cons(sK9,nil)),sK11) = sK4,
inference(cnf_transformation,[],[f136]) ).
fof(f173,plain,
! [X6,X7,X4,X5] :
( app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK4
| ~ ssList(X6)
| ~ ssList(X7)
| X4 = X5
| ~ ssItem(X4)
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f170,f168]) ).
fof(f168,plain,
sK6 = sK4,
inference(cnf_transformation,[],[f136]) ).
fof(f170,plain,
! [X6,X7,X4,X5] :
( ~ ssItem(X5)
| ~ ssList(X7)
| X4 = X5
| app(app(app(X6,cons(X4,nil)),cons(X5,nil)),X7) != sK6
| ~ ssList(X6)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC189+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.14 % 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.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 18:41:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (18830)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.21/0.52 % (18848)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.21/0.52 % (18824)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.21/0.53 % (18850)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.53 % (18835)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.53 % (18849)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.21/0.53 % (18823)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.53 % (18830)First to succeed.
% 0.21/0.53 % (18838)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.21/0.53 % (18844)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.53 % (18843)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (18830)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 % (18830)------------------------------
% 0.21/0.53 % (18830)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (18830)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (18830)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (18830)Memory used [KB]: 6140
% 0.21/0.53 % (18830)Time elapsed: 0.132 s
% 0.21/0.53 % (18830)Instructions burned: 4 (million)
% 0.21/0.53 % (18830)------------------------------
% 0.21/0.53 % (18830)------------------------------
% 0.21/0.53 % (18817)Success in time 0.179 s
%------------------------------------------------------------------------------