TSTP Solution File: SWC387+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC387+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 : n003.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:21:55 EDT 2024
% Result : Theorem 0.15s 0.41s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 8
% Syntax : Number of formulae : 49 ( 12 unt; 0 def)
% Number of atoms : 327 ( 157 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 425 ( 147 ~; 125 |; 129 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 36 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1053,plain,
$false,
inference(trivial_inequality_removal,[],[f1052]) ).
fof(f1052,plain,
nil != nil,
inference(superposition,[],[f1037,f1007]) ).
fof(f1007,plain,
nil = sK19,
inference(backward_demodulation,[],[f380,f1005]) ).
fof(f1005,plain,
nil = sK21,
inference(resolution,[],[f1004,f396]) ).
fof(f396,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f1004,plain,
( ~ ssList(nil)
| nil = sK21 ),
inference(resolution,[],[f1003,f379]) ).
fof(f379,plain,
ssList(sK21),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( ~ neq(sK21,nil)
| ( memberP(sK21,sK22)
& sK20 = cons(sK22,nil)
& ssItem(sK22) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK21
| nil = sK20 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21,sK22])],[f100,f255,f254,f253,f252,f251]) ).
fof(f251,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK18
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK18
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X3
| nil = sK20 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != X3
| nil = sK20 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ~ neq(sK21,nil)
| ? [X4] :
( memberP(sK21,X4)
& cons(X4,nil) = sK20
& ssItem(X4) ) )
& ( nil != sK18
| nil != sK19 )
& ( nil != sK21
| nil = sK20 )
& ! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X4] :
( memberP(sK21,X4)
& cons(X4,nil) = sK20
& ssItem(X4) )
=> ( memberP(sK21,sK22)
& sK20 = cons(sK22,nil)
& ssItem(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X0
| nil != X1 )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& 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] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( memberP(X1,X4)
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f1003,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = sK21 ),
inference(duplicate_literal_removal,[],[f1002]) ).
fof(f1002,plain,
( nil = sK21
| ~ ssList(nil)
| ~ ssList(sK21)
| ~ ssList(nil)
| ~ ssList(sK21)
| nil = sK21 ),
inference(resolution,[],[f988,f957]) ).
fof(f957,plain,
( ssItem(sK22)
| ~ ssList(nil)
| ~ ssList(sK21)
| nil = sK21 ),
inference(resolution,[],[f576,f385]) ).
fof(f385,plain,
( ~ neq(sK21,nil)
| ssItem(sK22) ),
inference(cnf_transformation,[],[f256]) ).
fof(f576,plain,
! [X0,X1] :
( neq(X0,X1)
| 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,[],[f199]) ).
fof(f199,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(f988,plain,
( ~ ssItem(sK22)
| nil = sK21
| ~ ssList(nil)
| ~ ssList(sK21) ),
inference(duplicate_literal_removal,[],[f985]) ).
fof(f985,plain,
( nil = sK21
| ~ ssItem(sK22)
| nil = sK21
| ~ ssList(nil)
| ~ ssList(sK21) ),
inference(resolution,[],[f984,f576]) ).
fof(f984,plain,
( ~ neq(sK21,nil)
| nil = sK21
| ~ ssItem(sK22) ),
inference(resolution,[],[f980,f387]) ).
fof(f387,plain,
( memberP(sK21,sK22)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f980,plain,
( ~ memberP(sK21,sK22)
| ~ ssItem(sK22)
| nil = sK21 ),
inference(trivial_inequality_removal,[],[f973]) ).
fof(f973,plain,
( sK18 != sK18
| ~ memberP(sK21,sK22)
| ~ ssItem(sK22)
| nil = sK21 ),
inference(superposition,[],[f640,f965]) ).
fof(f965,plain,
( sK18 = cons(sK22,nil)
| nil = sK21 ),
inference(resolution,[],[f964,f396]) ).
fof(f964,plain,
( ~ ssList(nil)
| nil = sK21
| sK18 = cons(sK22,nil) ),
inference(resolution,[],[f956,f379]) ).
fof(f956,plain,
( ~ ssList(sK21)
| ~ ssList(nil)
| nil = sK21
| sK18 = cons(sK22,nil) ),
inference(resolution,[],[f576,f639]) ).
fof(f639,plain,
( ~ neq(sK21,nil)
| sK18 = cons(sK22,nil) ),
inference(forward_demodulation,[],[f386,f381]) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f386,plain,
( ~ neq(sK21,nil)
| sK20 = cons(sK22,nil) ),
inference(cnf_transformation,[],[f256]) ).
fof(f640,plain,
! [X5] :
( cons(X5,nil) != sK18
| ~ memberP(sK21,X5)
| ~ ssItem(X5) ),
inference(forward_demodulation,[],[f382,f380]) ).
fof(f382,plain,
! [X5] :
( ~ memberP(sK19,X5)
| cons(X5,nil) != sK18
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f256]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f1037,plain,
nil != sK19,
inference(trivial_inequality_removal,[],[f1026]) ).
fof(f1026,plain,
( nil != nil
| nil != sK19 ),
inference(backward_demodulation,[],[f384,f1025]) ).
fof(f1025,plain,
nil = sK18,
inference(backward_demodulation,[],[f381,f1024]) ).
fof(f1024,plain,
nil = sK20,
inference(trivial_inequality_removal,[],[f1008]) ).
fof(f1008,plain,
( nil != nil
| nil = sK20 ),
inference(backward_demodulation,[],[f383,f1005]) ).
fof(f383,plain,
( nil != sK21
| nil = sK20 ),
inference(cnf_transformation,[],[f256]) ).
fof(f384,plain,
( nil != sK19
| nil != sK18 ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWC387+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n003.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 04:19:03 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (14656)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (14659)WARNING: value z3 for option sas not known
% 0.15/0.38 % (14657)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (14660)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (14658)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38 % (14661)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.15/0.38 % (14662)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.15/0.38 % (14663)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.15/0.38 % (14659)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.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [1]
% 0.15/0.40 TRYING [2]
% 0.15/0.40 TRYING [2]
% 0.15/0.41 % (14662)First to succeed.
% 0.15/0.41 % (14662)Refutation found. Thanks to Tanya!
% 0.15/0.41 % SZS status Theorem for theBenchmark
% 0.15/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.41 % (14662)------------------------------
% 0.15/0.41 % (14662)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.41 % (14662)Termination reason: Refutation
% 0.15/0.41
% 0.15/0.41 % (14662)Memory used [KB]: 1654
% 0.15/0.41 % (14662)Time elapsed: 0.028 s
% 0.15/0.41 % (14662)Instructions burned: 48 (million)
% 0.15/0.41 % (14662)------------------------------
% 0.15/0.41 % (14662)------------------------------
% 0.15/0.41 % (14656)Success in time 0.037 s
%------------------------------------------------------------------------------