TSTP Solution File: SWC095+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SWC095+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_sat --cores 0 -t %d %s
% Computer : n025.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:41:43 EDT 2022
% Result : Theorem 0.21s 0.54s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 9 unt; 0 def)
% Number of atoms : 237 ( 97 equ)
% Maximal formula atoms : 32 ( 9 avg)
% Number of connectives : 299 ( 88 ~; 70 |; 124 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 8 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 : 112 ( 50 !; 62 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f607,plain,
$false,
inference(subsumption_resolution,[],[f606,f388]) ).
fof(f388,plain,
ssList(sK18),
inference(cnf_transformation,[],[f257]) ).
fof(f257,plain,
( ssList(sK13)
& ssList(sK14)
& sK12 = sK14
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = sK15
& ssList(sK15)
& ssList(sK16)
& ssList(sK17)
& app(sK16,sK18) = sK15
& sK14 = app(app(sK16,sK17),sK18)
& ssList(sK18)
& ssList(sK12) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14,sK15,sK16,sK17,sK18])],[f144,f256,f255,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != X0 )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK12 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) ) )
& ssList(sK12) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK12 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) ) )
=> ( ssList(sK13)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( sK12 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( sK12 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) )
=> ( ssList(sK14)
& ? [X3] :
( sK12 = sK14
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = sK14
& ssList(X9) ) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( sK12 = sK14
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = sK14
& ssList(X9) ) ) ) )
=> ( sK12 = sK14
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12 )
| ~ ssList(X5) ) )
& sK13 = sK15
& ssList(sK15)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = sK15
& app(app(X7,X8),X9) = sK14
& ssList(X9) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = sK15
& app(app(X7,X8),X9) = sK14
& ssList(X9) ) ) )
=> ( ssList(sK16)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(sK16,X9) = sK15
& sK14 = app(app(sK16,X8),X9)
& ssList(X9) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X8] :
( ssList(X8)
& ? [X9] :
( app(sK16,X9) = sK15
& sK14 = app(app(sK16,X8),X9)
& ssList(X9) ) )
=> ( ssList(sK17)
& ? [X9] :
( app(sK16,X9) = sK15
& sK14 = app(app(sK16,sK17),X9)
& ssList(X9) ) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X9] :
( app(sK16,X9) = sK15
& sK14 = app(app(sK16,sK17),X9)
& ssList(X9) )
=> ( app(sK16,sK18) = sK15
& sK14 = app(app(sK16,sK17),sK18)
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != X0 )
| ~ ssList(X5) ) )
& X1 = X3
& ssList(X3)
& ? [X7] :
( ssList(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( app(X7,X9) = X3
& app(app(X7,X8),X9) = X2
& ssList(X9) ) ) ) ) ) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X1
& ssList(X6)
& app(app(X4,X5),X6) = X0 ) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(app(X7,X8),X9) != X2
| ~ ssList(X9)
| app(X7,X9) != X3 ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| ? [X4] :
( ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X4,X6) = X1
& ssList(X6)
& app(app(X4,X5),X6) = X0 ) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(app(X7,X8),X9) != X2
| ~ ssList(X9)
| app(X7,X9) != X3 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f606,plain,
~ ssList(sK18),
inference(subsumption_resolution,[],[f605,f390]) ).
fof(f390,plain,
app(sK16,sK18) = sK15,
inference(cnf_transformation,[],[f257]) ).
fof(f605,plain,
( app(sK16,sK18) != sK15
| ~ ssList(sK18) ),
inference(subsumption_resolution,[],[f604,f392]) ).
fof(f392,plain,
ssList(sK16),
inference(cnf_transformation,[],[f257]) ).
fof(f604,plain,
( ~ ssList(sK16)
| ~ ssList(sK18)
| app(sK16,sK18) != sK15 ),
inference(subsumption_resolution,[],[f601,f391]) ).
fof(f391,plain,
ssList(sK17),
inference(cnf_transformation,[],[f257]) ).
fof(f601,plain,
( ~ ssList(sK17)
| ~ ssList(sK18)
| ~ ssList(sK16)
| app(sK16,sK18) != sK15 ),
inference(trivial_inequality_removal,[],[f600]) ).
fof(f600,plain,
( app(sK16,sK18) != sK15
| ~ ssList(sK18)
| ~ ssList(sK17)
| ~ ssList(sK16)
| sK14 != sK14 ),
inference(superposition,[],[f562,f389]) ).
fof(f389,plain,
sK14 = app(app(sK16,sK17),sK18),
inference(cnf_transformation,[],[f257]) ).
fof(f562,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK14
| ~ ssList(X5)
| ~ ssList(X6)
| app(X4,X6) != sK15
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f395,f394,f396]) ).
fof(f396,plain,
sK12 = sK14,
inference(cnf_transformation,[],[f257]) ).
fof(f394,plain,
sK13 = sK15,
inference(cnf_transformation,[],[f257]) ).
fof(f395,plain,
! [X6,X4,X5] :
( ~ ssList(X4)
| ~ ssList(X6)
| app(X4,X6) != sK13
| app(app(X4,X5),X6) != sK12
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC095+1 : TPTP v8.1.0. Released v2.4.0.
% 0.13/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Aug 30 18:22:45 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.52 % (13817)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.21/0.52 % (13816)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52 % (13825)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.21/0.52 % (13834)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.21/0.52 % (13826)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.53 % (13818)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53 % (13833)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.21/0.54 % (13834)First to succeed.
% 0.21/0.54 % (13834)Refutation found. Thanks to Tanya!
% 0.21/0.54 % SZS status Theorem for theBenchmark
% 0.21/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54 % (13834)------------------------------
% 0.21/0.54 % (13834)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54 % (13834)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54 % (13834)Termination reason: Refutation
% 0.21/0.54
% 0.21/0.54 % (13834)Memory used [KB]: 1407
% 0.21/0.54 % (13834)Time elapsed: 0.076 s
% 0.21/0.54 % (13834)Instructions burned: 11 (million)
% 0.21/0.54 % (13834)------------------------------
% 0.21/0.54 % (13834)------------------------------
% 0.21/0.54 % (13811)Success in time 0.177 s
%------------------------------------------------------------------------------