TSTP Solution File: SWC006+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC006+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:38:10 EDT 2022
% Result : Theorem 0.20s 0.54s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 27 ( 9 unt; 0 def)
% Number of atoms : 253 ( 102 equ)
% Maximal formula atoms : 32 ( 9 avg)
% Number of connectives : 321 ( 95 ~; 76 |; 128 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 122 ( 57 !; 65 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f234,plain,
$false,
inference(subsumption_resolution,[],[f233,f157]) ).
fof(f157,plain,
ssList(sK8),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
( ssList(sK4)
& sK2 = sK4
& ssList(sK6)
& ssList(sK7)
& sK4 = app(sK6,sK8)
& app(app(sK6,sK7),sK8) = sK5
& ssList(sK8)
& ssList(sK5)
& sK3 = sK5
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) )
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7,sK8])],[f105,f129,f128,f127,f126,f125,f124,f123]) ).
fof(f123,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& X1 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != X1
| app(X7,X9) != X0
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& X1 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != X1
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& X1 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != X1
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& sK3 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK2 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& sK3 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
=> ( ssList(sK4)
& ? [X3] :
( sK2 = sK4
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = sK4
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& sK3 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X3] :
( sK2 = sK4
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = sK4
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& sK3 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) )
=> ( sK2 = sK4
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = sK4
& app(app(X4,X5),X6) = sK5
& ssList(X6) ) ) )
& ssList(sK5)
& sK3 = sK5
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) ),
introduced(choice_axiom,[]) ).
fof(f127,plain,
( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = sK4
& app(app(X4,X5),X6) = sK5
& ssList(X6) ) ) )
=> ( ssList(sK6)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(sK6,X6) = sK4
& app(app(sK6,X5),X6) = sK5
& ssList(X6) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f128,plain,
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(sK6,X6) = sK4
& app(app(sK6,X5),X6) = sK5
& ssList(X6) ) )
=> ( ssList(sK7)
& ? [X6] :
( app(sK6,X6) = sK4
& sK5 = app(app(sK6,sK7),X6)
& ssList(X6) ) ) ),
introduced(choice_axiom,[]) ).
fof(f129,plain,
( ? [X6] :
( app(sK6,X6) = sK4
& sK5 = app(app(sK6,sK7),X6)
& ssList(X6) )
=> ( sK4 = app(sK6,sK8)
& app(app(sK6,sK7),sK8) = sK5
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) ) ) )
& ssList(X3)
& X1 = X3
& ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ! [X9] :
( app(app(X7,X8),X9) != X1
| app(X7,X9) != X0
| ~ ssList(X9) ) )
| ~ ssList(X7) ) ) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(app(X4,X5),X6) != X3
| ~ ssList(X6)
| app(X4,X6) != X2 ) ) )
| ~ ssList(X3)
| X1 != X3
| X0 != X2
| ? [X7] :
( ssList(X7)
& ? [X8] :
( ? [X9] :
( ssList(X9)
& app(app(X7,X8),X9) = X1
& app(X7,X9) = X0 )
& ssList(X8) ) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(X7,X9) != X2
| app(app(X7,X8),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& ssList(X6) ) )
& ssList(X4) )
| X0 != X2
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( X1 != X3
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ~ ssList(X9)
| app(X7,X9) != X2
| app(app(X7,X8),X9) != X3 ) ) )
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(app(X4,X5),X6) = X1
& app(X4,X6) = X0
& ssList(X6) ) )
& ssList(X4) )
| X0 != X2
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f233,plain,
~ ssList(sK8),
inference(subsumption_resolution,[],[f232,f160]) ).
fof(f160,plain,
ssList(sK7),
inference(cnf_transformation,[],[f130]) ).
fof(f232,plain,
( ~ ssList(sK7)
| ~ ssList(sK8) ),
inference(subsumption_resolution,[],[f231,f159]) ).
fof(f159,plain,
sK4 = app(sK6,sK8),
inference(cnf_transformation,[],[f130]) ).
fof(f231,plain,
( sK4 != app(sK6,sK8)
| ~ ssList(sK8)
| ~ ssList(sK7) ),
inference(subsumption_resolution,[],[f230,f161]) ).
fof(f161,plain,
ssList(sK6),
inference(cnf_transformation,[],[f130]) ).
fof(f230,plain,
( ~ ssList(sK6)
| sK4 != app(sK6,sK8)
| ~ ssList(sK8)
| ~ ssList(sK7) ),
inference(trivial_inequality_removal,[],[f229]) ).
fof(f229,plain,
( ~ ssList(sK7)
| sK4 != app(sK6,sK8)
| sK5 != sK5
| ~ ssList(sK8)
| ~ ssList(sK6) ),
inference(superposition,[],[f169,f158]) ).
fof(f158,plain,
app(app(sK6,sK7),sK8) = sK5,
inference(cnf_transformation,[],[f130]) ).
fof(f169,plain,
! [X8,X9,X7] :
( app(app(X7,X8),X9) != sK5
| app(X7,X9) != sK4
| ~ ssList(X7)
| ~ ssList(X8)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f154,f155,f162]) ).
fof(f162,plain,
sK2 = sK4,
inference(cnf_transformation,[],[f130]) ).
fof(f155,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f130]) ).
fof(f154,plain,
! [X8,X9,X7] :
( ~ ssList(X8)
| app(app(X7,X8),X9) != sK3
| app(X7,X9) != sK2
| ~ ssList(X9)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f130]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC006+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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 : n017.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 17:18:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % (16078)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.52 % (16070)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.52 % (16070)Instruction limit reached!
% 0.20/0.52 % (16070)------------------------------
% 0.20/0.52 % (16070)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (16070)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (16070)Termination reason: Unknown
% 0.20/0.52 % (16070)Termination phase: Preprocessing 2
% 0.20/0.52
% 0.20/0.52 % (16070)Memory used [KB]: 1535
% 0.20/0.52 % (16070)Time elapsed: 0.005 s
% 0.20/0.52 % (16070)Instructions burned: 3 (million)
% 0.20/0.52 % (16070)------------------------------
% 0.20/0.52 % (16070)------------------------------
% 0.20/0.52 % (16062)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.53 % (16083)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.20/0.53 % (16061)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.53 % (16060)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.20/0.53 % (16057)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.20/0.53 % (16059)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.53 % (16066)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.53 % (16061)First to succeed.
% 0.20/0.53 % (16064)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.20/0.53 % (16058)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)
% 0.20/0.54 % (16063)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.54 % (16065)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.20/0.54 % (16077)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 % (16075)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.20/0.54 % (16061)Refutation found. Thanks to Tanya!
% 0.20/0.54 % SZS status Theorem for theBenchmark
% 0.20/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.54 % (16061)------------------------------
% 0.20/0.54 % (16061)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (16061)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (16061)Termination reason: Refutation
% 0.20/0.54
% 0.20/0.54 % (16061)Memory used [KB]: 1663
% 0.20/0.54 % (16061)Time elapsed: 0.125 s
% 0.20/0.54 % (16061)Instructions burned: 6 (million)
% 0.20/0.54 % (16061)------------------------------
% 0.20/0.54 % (16061)------------------------------
% 0.20/0.54 % (16055)Success in time 0.183 s
%------------------------------------------------------------------------------