TSTP Solution File: SWC320+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -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 : Tue Apr 30 16:20:43 EDT 2024
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 10 unt; 0 def)
% Number of atoms : 376 ( 193 equ)
% Maximal formula atoms : 40 ( 6 avg)
% Number of connectives : 476 ( 158 ~; 149 |; 147 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 98 ( 50 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1592,plain,
$false,
inference(resolution,[],[f1586,f399]) ).
fof(f399,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1586,plain,
~ ssList(nil),
inference(resolution,[],[f1560,f636]) ).
fof(f636,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f629]) ).
fof(f629,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f578]) ).
fof(f578,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f357]) ).
fof(f357,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f1560,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f1556]) ).
fof(f1556,plain,
( nil != nil
| neq(nil,nil) ),
inference(backward_demodulation,[],[f1516,f1540]) ).
fof(f1540,plain,
nil = sK18,
inference(backward_demodulation,[],[f381,f1538]) ).
fof(f1538,plain,
nil = sK20,
inference(trivial_inequality_removal,[],[f1522]) ).
fof(f1522,plain,
( nil != nil
| nil = sK20 ),
inference(backward_demodulation,[],[f649,f1514]) ).
fof(f1514,plain,
nil = sK19,
inference(duplicate_literal_removal,[],[f1513]) ).
fof(f1513,plain,
( nil = sK19
| nil = sK19 ),
inference(resolution,[],[f1512,f653]) ).
fof(f653,plain,
( ssList(sK23)
| nil = sK19 ),
inference(resolution,[],[f387,f647]) ).
fof(f647,plain,
( ~ neq(sK19,nil)
| ssList(sK23) ),
inference(forward_demodulation,[],[f384,f380]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(sK21,nil)
| ( sK21 = app(sK23,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),sK23)
& ssList(sK23)
& ssItem(sK22) ) )
& ( nil != sK21
| nil = sK20 )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22,sK23])],[f99,f255,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK20
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK20 )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = sK20
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = sK20 )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != sK19
| app(cons(X4,nil),X5) != sK18
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& ( ~ neq(sK21,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK21
& app(cons(X6,nil),X7) = sK20
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != sK21
| nil = sK20 )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = sK21
& app(cons(X6,nil),X7) = sK20
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( sK21 = app(X7,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),X7)
& ssList(X7) )
& ssItem(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X7] :
( sK21 = app(X7,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),X7)
& ssList(X7) )
=> ( sK21 = app(sK23,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),sK23)
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( app(X5,cons(X4,nil)) != X1
| app(cons(X4,nil),X5) != X0
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X3
& app(cons(X6,nil),X7) = X2
& ssList(X7) )
& ssItem(X6) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& 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] :
( ( ( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X1
& app(cons(X4,nil),X5) = X0
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2
| ~ ssList(X7) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( app(X7,cons(X6,nil)) = X1
& app(cons(X6,nil),X7) = X0
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f384,plain,
( ~ neq(sK21,nil)
| ssList(sK23) ),
inference(cnf_transformation,[],[f256]) ).
fof(f387,plain,
( neq(sK19,nil)
| nil = sK19 ),
inference(cnf_transformation,[],[f256]) ).
fof(f1512,plain,
( ~ ssList(sK23)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f1511]) ).
fof(f1511,plain,
( ~ ssList(sK23)
| nil = sK19
| nil = sK19 ),
inference(resolution,[],[f1510,f652]) ).
fof(f652,plain,
( ssItem(sK22)
| nil = sK19 ),
inference(resolution,[],[f387,f648]) ).
fof(f648,plain,
( ~ neq(sK19,nil)
| ssItem(sK22) ),
inference(forward_demodulation,[],[f383,f380]) ).
fof(f383,plain,
( ~ neq(sK21,nil)
| ssItem(sK22) ),
inference(cnf_transformation,[],[f256]) ).
fof(f1510,plain,
( ~ ssItem(sK22)
| ~ ssList(sK23)
| nil = sK19 ),
inference(trivial_inequality_removal,[],[f1509]) ).
fof(f1509,plain,
( sK19 != sK19
| ~ ssList(sK23)
| ~ ssItem(sK22)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f1508]) ).
fof(f1508,plain,
( sK19 != sK19
| ~ ssList(sK23)
| ~ ssItem(sK22)
| nil = sK19
| nil = sK19 ),
inference(superposition,[],[f1507,f654]) ).
fof(f654,plain,
( sK19 = app(sK23,cons(sK22,nil))
| nil = sK19 ),
inference(resolution,[],[f644,f387]) ).
fof(f644,plain,
( ~ neq(sK19,nil)
| sK19 = app(sK23,cons(sK22,nil)) ),
inference(forward_demodulation,[],[f643,f380]) ).
fof(f643,plain,
( ~ neq(sK19,nil)
| sK21 = app(sK23,cons(sK22,nil)) ),
inference(forward_demodulation,[],[f386,f380]) ).
fof(f386,plain,
( ~ neq(sK21,nil)
| sK21 = app(sK23,cons(sK22,nil)) ),
inference(cnf_transformation,[],[f256]) ).
fof(f1507,plain,
( sK19 != app(sK23,cons(sK22,nil))
| ~ ssList(sK23)
| ~ ssItem(sK22)
| nil = sK19 ),
inference(trivial_inequality_removal,[],[f1506]) ).
fof(f1506,plain,
( sK18 != sK18
| sK19 != app(sK23,cons(sK22,nil))
| ~ ssList(sK23)
| ~ ssItem(sK22)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f1505]) ).
fof(f1505,plain,
( sK18 != sK18
| sK19 != app(sK23,cons(sK22,nil))
| ~ ssList(sK23)
| ~ ssItem(sK22)
| nil = sK19
| nil = sK19 ),
inference(superposition,[],[f389,f655]) ).
fof(f655,plain,
( sK18 = app(cons(sK22,nil),sK23)
| nil = sK19 ),
inference(resolution,[],[f646,f387]) ).
fof(f646,plain,
( ~ neq(sK19,nil)
| sK18 = app(cons(sK22,nil),sK23) ),
inference(forward_demodulation,[],[f645,f381]) ).
fof(f645,plain,
( ~ neq(sK19,nil)
| sK20 = app(cons(sK22,nil),sK23) ),
inference(forward_demodulation,[],[f385,f380]) ).
fof(f385,plain,
( ~ neq(sK21,nil)
| sK20 = app(cons(sK22,nil),sK23) ),
inference(cnf_transformation,[],[f256]) ).
fof(f389,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK18
| app(X5,cons(X4,nil)) != sK19
| ~ ssList(X5)
| ~ ssItem(X4)
| nil = sK19 ),
inference(cnf_transformation,[],[f256]) ).
fof(f649,plain,
( nil != sK19
| nil = sK20 ),
inference(forward_demodulation,[],[f382,f380]) ).
fof(f382,plain,
( nil != sK21
| nil = sK20 ),
inference(cnf_transformation,[],[f256]) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f1516,plain,
( neq(nil,nil)
| nil != sK18 ),
inference(backward_demodulation,[],[f388,f1514]) ).
fof(f388,plain,
( nil != sK18
| neq(sK19,nil) ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 04:23:56 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (16615)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.37 % (16621)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.13/0.37 % (16618)WARNING: value z3 for option sas not known
% 0.13/0.37 % (16617)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.37 % (16622)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.13/0.37 % (16616)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.37 % (16619)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.37 % (16620)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.13/0.37 % (16618)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.38 TRYING [1]
% 0.13/0.38 TRYING [1]
% 0.13/0.39 TRYING [2]
% 0.13/0.39 TRYING [2]
% 0.20/0.40 TRYING [3]
% 0.20/0.40 TRYING [3]
% 0.20/0.42 % (16621)First to succeed.
% 0.20/0.42 % (16621)Refutation found. Thanks to Tanya!
% 0.20/0.42 % SZS status Theorem for theBenchmark
% 0.20/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.42 % (16621)------------------------------
% 0.20/0.42 % (16621)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.20/0.42 % (16621)Termination reason: Refutation
% 0.20/0.42
% 0.20/0.42 % (16621)Memory used [KB]: 2191
% 0.20/0.42 % (16621)Time elapsed: 0.050 s
% 0.20/0.42 % (16621)Instructions burned: 106 (million)
% 0.20/0.42 % (16621)------------------------------
% 0.20/0.42 % (16621)------------------------------
% 0.20/0.42 % (16615)Success in time 0.067 s
%------------------------------------------------------------------------------