TSTP Solution File: SWC040+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC040+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n024.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 May 21 04:41:01 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 9 unt; 0 def)
% Number of atoms : 210 ( 124 equ)
% Maximal formula atoms : 30 ( 9 avg)
% Number of connectives : 238 ( 50 ~; 36 |; 134 &)
% ( 0 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 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 : 60 ( 12 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f655,plain,
$false,
inference(trivial_inequality_removal,[],[f654]) ).
fof(f654,plain,
nil != nil,
inference(superposition,[],[f383,f649]) ).
fof(f649,plain,
nil = sK18,
inference(backward_demodulation,[],[f382,f647]) ).
fof(f647,plain,
nil = sK20,
inference(trivial_inequality_removal,[],[f646]) ).
fof(f646,plain,
( nil != nil
| nil = sK20 ),
inference(forward_demodulation,[],[f384,f640]) ).
fof(f640,plain,
nil = sK21,
inference(backward_demodulation,[],[f381,f380]) ).
fof(f380,plain,
nil = sK19,
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( ~ neq(sK21,nil)
| ( sK21 = app(sK23,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),sK23)
& ssList(sK23)
& ssItem(sK22) ) )
& ( nil != sK21
| nil = sK20 )
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& 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] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK18
& sK18 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK18
& sK18 = X2
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK20
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK20 )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK20
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK20 )
& nil != sK18
& sK18 = sK20
& sK19 = X3
& nil = sK19
& ssList(X3) )
=> ( ( ~ neq(sK21,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK21
& app(cons(X4,nil),X5) = sK20
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK21
| nil = sK20 )
& nil != sK18
& sK18 = sK20
& sK19 = sK21
& nil = sK19
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK21
& app(cons(X4,nil),X5) = sK20
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK21 = app(X5,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),X5)
& ssList(X5) )
& ssItem(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X5] :
( sK21 = app(X5,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),X5)
& ssList(X5) )
=> ( sK21 = app(sK23,cons(sK22,nil))
& sK20 = app(cons(sK22,nil),sK23)
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f381,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f384,plain,
( nil != sK21
| nil = sK20 ),
inference(cnf_transformation,[],[f256]) ).
fof(f382,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f383,plain,
nil != sK18,
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC040+1 : TPTP v8.2.0. Released v2.4.0.
% 0.11/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.35 % Computer : n024.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 : Sun May 19 02:53:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % (11430)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.38 % (11435)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.13/0.38 % (11438)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.13/0.38 % (11436)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.13/0.38 % (11440)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.38 % (11439)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.38 % (11441)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.38 % (11437)WARNING: value z3 for option sas not known
% 0.13/0.39 % (11437)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.39 % (11440)First to succeed.
% 0.13/0.39 % (11439)Also succeeded, but the first one will report.
% 0.13/0.39 % (11440)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-11430"
% 0.13/0.39 % (11440)Refutation found. Thanks to Tanya!
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.39 % (11440)------------------------------
% 0.13/0.39 % (11440)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.39 % (11440)Termination reason: Refutation
% 0.13/0.39
% 0.13/0.39 % (11440)Memory used [KB]: 1236
% 0.13/0.39 % (11440)Time elapsed: 0.012 s
% 0.13/0.39 % (11440)Instructions burned: 20 (million)
% 0.13/0.39 % (11430)Success in time 0.032 s
%------------------------------------------------------------------------------