TSTP Solution File: SWC415+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC415+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 : n009.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:22:53 EDT 2024
% Result : Theorem 0.21s 0.48s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 9
% Syntax : Number of formulae : 66 ( 13 unt; 0 def)
% Number of atoms : 336 ( 102 equ)
% Maximal formula atoms : 18 ( 5 avg)
% Number of connectives : 416 ( 146 ~; 144 |; 104 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 111 ( 77 !; 34 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2723,plain,
$false,
inference(resolution,[],[f2722,f398]) ).
fof(f398,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f2722,plain,
~ ssList(nil),
inference(resolution,[],[f2341,f638]) ).
fof(f638,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f631]) ).
fof(f631,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f577]) ).
fof(f577,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f360]) ).
fof(f360,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/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f2341,plain,
neq(nil,nil),
inference(backward_demodulation,[],[f699,f2335]) ).
fof(f2335,plain,
nil = sK20,
inference(resolution,[],[f2304,f398]) ).
fof(f2304,plain,
( ~ ssList(nil)
| nil = sK20 ),
inference(resolution,[],[f2303,f649]) ).
fof(f649,plain,
ssList(sK20),
inference(forward_demodulation,[],[f385,f386]) ).
fof(f386,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f259]) ).
fof(f259,plain,
( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,sK22,sK21) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22)
& ssList(sK21)
& ssList(sK20)
& ssList(sK19) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19,sK20,sK21,sK22])],[f225,f258,f257,f256,f255]) ).
fof(f255,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,X0,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,sK19,X3,X2) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,sK19,X3,X2) )
& sK19 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,X3,X2) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f257,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,X3,X2) )
& sK19 = X2
& sK20 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,X3,sK21) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f258,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,X3,sK21) )
& sK19 = sK21
& sK20 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK22,nil)
& neq(sK20,nil) )
| sP0(sK20,sK19,sK22,sK21) )
& sK19 = sK21
& sK20 = sK22
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,X0,X3,X2) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f224]) ).
fof(f224,plain,
! [X1,X0,X3,X2] :
( ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) )
| ~ sP0(X1,X0,X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& 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)
& neq(X1,nil) )
| ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) ) )
& 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)
| ~ neq(X1,nil) )
& ( ? [X4] :
( neq(nil,X1)
& X0 = X4
& tl(X1) = X4
& ssList(X4) )
| ? [X5] :
( neq(nil,X3)
& tl(X3) = X5
& X2 != X5
& ssList(X5) )
| ~ neq(X1,nil) ) )
| 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)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| 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)
| ~ neq(X1,nil) )
& ( ? [X5] :
( neq(nil,X1)
& X0 = X5
& tl(X1) = X5
& ssList(X5) )
| ? [X4] :
( neq(nil,X3)
& tl(X3) = X4
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f385,plain,
ssList(sK22),
inference(cnf_transformation,[],[f259]) ).
fof(f2303,plain,
( ~ ssList(sK20)
| nil = sK20
| ~ ssList(nil) ),
inference(resolution,[],[f2302,f650]) ).
fof(f650,plain,
ssList(sK19),
inference(forward_demodulation,[],[f384,f387]) ).
fof(f387,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f259]) ).
fof(f384,plain,
ssList(sK21),
inference(cnf_transformation,[],[f259]) ).
fof(f2302,plain,
( ~ ssList(sK19)
| nil = sK20
| ~ ssList(sK20)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f2299]) ).
fof(f2299,plain,
( nil = sK20
| ~ ssList(sK19)
| nil = sK20
| ~ ssList(sK20)
| ~ ssList(nil) ),
inference(resolution,[],[f2294,f578]) ).
fof(f578,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f360]) ).
fof(f2294,plain,
( ~ neq(nil,sK20)
| nil = sK20
| ~ ssList(sK19) ),
inference(resolution,[],[f2293,f699]) ).
fof(f2293,plain,
( ~ neq(sK20,nil)
| ~ neq(nil,sK20)
| nil = sK20
| ~ ssList(sK19) ),
inference(resolution,[],[f2194,f646]) ).
fof(f646,plain,
( sP0(sK20,sK19,sK20,sK19)
| ~ neq(sK20,nil) ),
inference(forward_demodulation,[],[f645,f386]) ).
fof(f645,plain,
( sP0(sK20,sK19,sK22,sK19)
| ~ neq(sK20,nil) ),
inference(forward_demodulation,[],[f644,f387]) ).
fof(f644,plain,
( ~ neq(sK20,nil)
| sP0(sK20,sK19,sK22,sK21) ),
inference(forward_demodulation,[],[f389,f386]) ).
fof(f389,plain,
( ~ neq(sK22,nil)
| sP0(sK20,sK19,sK22,sK21) ),
inference(cnf_transformation,[],[f259]) ).
fof(f2194,plain,
! [X0,X1] :
( ~ sP0(sK20,sK19,X0,X1)
| ~ ssList(sK19)
| ~ neq(nil,sK20)
| nil = sK20 ),
inference(superposition,[],[f608,f2186]) ).
fof(f2186,plain,
( sK19 = tl(sK20)
| nil = sK20 ),
inference(resolution,[],[f2185,f398]) ).
fof(f2185,plain,
( ~ ssList(nil)
| sK19 = tl(sK20)
| nil = sK20 ),
inference(resolution,[],[f2184,f649]) ).
fof(f2184,plain,
( ~ ssList(sK20)
| nil = sK20
| sK19 = tl(sK20)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f2183]) ).
fof(f2183,plain,
( sK19 = tl(sK20)
| nil = sK20
| ~ ssList(sK20)
| ~ ssList(nil)
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f2181,f466]) ).
fof(f466,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f154]) ).
fof(f154,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f153]) ).
fof(f153,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax24) ).
fof(f2181,plain,
( ~ ssList(tl(sK20))
| sK19 = tl(sK20)
| nil = sK20
| ~ ssList(sK20)
| ~ ssList(nil) ),
inference(resolution,[],[f2178,f578]) ).
fof(f2178,plain,
( ~ neq(nil,sK20)
| ~ ssList(tl(sK20))
| sK19 = tl(sK20) ),
inference(resolution,[],[f2165,f699]) ).
fof(f2165,plain,
( ~ neq(sK20,nil)
| ~ ssList(tl(sK20))
| ~ neq(nil,sK20)
| sK19 = tl(sK20) ),
inference(resolution,[],[f609,f646]) ).
fof(f609,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| tl(X2) = X3
| ~ ssList(tl(X2))
| ~ neq(nil,X2) ),
inference(equality_resolution,[],[f380]) ).
fof(f380,plain,
! [X2,X3,X0,X1,X5] :
( ~ neq(nil,X2)
| tl(X2) != X5
| X3 = X5
| ~ ssList(X5)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
! [X0,X1,X2,X3] :
( ( ! [X4] :
( ~ neq(nil,X0)
| X1 != X4
| tl(X0) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X2)
| tl(X2) != X5
| X3 = X5
| ~ ssList(X5) )
& neq(X0,nil) )
| ~ sP0(X0,X1,X2,X3) ),
inference(rectify,[],[f253]) ).
fof(f253,plain,
! [X1,X0,X3,X2] :
( ( ! [X4] :
( ~ neq(nil,X1)
| X0 != X4
| tl(X1) != X4
| ~ ssList(X4) )
& ! [X5] :
( ~ neq(nil,X3)
| tl(X3) != X5
| X2 = X5
| ~ ssList(X5) )
& neq(X1,nil) )
| ~ sP0(X1,X0,X3,X2) ),
inference(nnf_transformation,[],[f224]) ).
fof(f608,plain,
! [X2,X3,X0] :
( ~ sP0(X0,tl(X0),X2,X3)
| ~ ssList(tl(X0))
| ~ neq(nil,X0) ),
inference(equality_resolution,[],[f607]) ).
fof(f607,plain,
! [X2,X3,X0,X4] :
( ~ neq(nil,X0)
| tl(X0) != X4
| ~ ssList(X4)
| ~ sP0(X0,X4,X2,X3) ),
inference(equality_resolution,[],[f381]) ).
fof(f381,plain,
! [X2,X3,X0,X1,X4] :
( ~ neq(nil,X0)
| X1 != X4
| tl(X0) != X4
| ~ ssList(X4)
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f254]) ).
fof(f699,plain,
neq(sK20,nil),
inference(duplicate_literal_removal,[],[f697]) ).
fof(f697,plain,
( neq(sK20,nil)
| neq(sK20,nil) ),
inference(resolution,[],[f379,f648]) ).
fof(f648,plain,
( sP0(sK20,sK19,sK20,sK19)
| neq(sK20,nil) ),
inference(forward_demodulation,[],[f647,f386]) ).
fof(f647,plain,
( sP0(sK20,sK19,sK22,sK19)
| neq(sK20,nil) ),
inference(forward_demodulation,[],[f388,f387]) ).
fof(f388,plain,
( neq(sK20,nil)
| sP0(sK20,sK19,sK22,sK21) ),
inference(cnf_transformation,[],[f259]) ).
fof(f379,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| neq(X0,nil) ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC415+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.14/0.35 % Computer : n009.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 Apr 30 04:05:11 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (23700)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (23703)WARNING: value z3 for option sas not known
% 0.14/0.38 % (23704)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (23702)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 % (23707)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.14/0.38 % (23703)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.14/0.38 % (23706)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.14/0.38 % (23705)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.14/0.38 % (23701)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [1]
% 0.14/0.39 TRYING [2]
% 0.14/0.39 TRYING [2]
% 0.21/0.40 TRYING [3]
% 0.21/0.41 TRYING [3]
% 0.21/0.41 TRYING [1]
% 0.21/0.41 TRYING [2]
% 0.21/0.42 TRYING [3]
% 0.21/0.46 TRYING [4]
% 0.21/0.46 TRYING [4]
% 0.21/0.47 % (23706)First to succeed.
% 0.21/0.48 TRYING [4]
% 0.21/0.48 % (23706)Refutation found. Thanks to Tanya!
% 0.21/0.48 % SZS status Theorem for theBenchmark
% 0.21/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.48 % (23706)------------------------------
% 0.21/0.48 % (23706)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.48 % (23706)Termination reason: Refutation
% 0.21/0.48
% 0.21/0.48 % (23706)Memory used [KB]: 2965
% 0.21/0.48 % (23706)Time elapsed: 0.101 s
% 0.21/0.48 % (23706)Instructions burned: 189 (million)
% 0.21/0.48 % (23706)------------------------------
% 0.21/0.48 % (23706)------------------------------
% 0.21/0.48 % (23700)Success in time 0.12 s
%------------------------------------------------------------------------------