TSTP Solution File: SWC017+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC017+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 : n032.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 : Sun May 5 09:51:36 EDT 2024
% Result : Theorem 0.14s 0.34s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 10 unt; 0 def)
% Number of atoms : 305 ( 111 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 374 ( 122 ~; 124 |; 110 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 59 ( 37 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f757,plain,
$false,
inference(resolution,[],[f756,f395]) ).
fof(f395,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f756,plain,
~ ssList(nil),
inference(resolution,[],[f754,f632]) ).
fof(f632,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f625]) ).
fof(f625,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f574]) ).
fof(f574,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f354]) ).
fof(f354,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f197]) ).
fof(f197,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(f754,plain,
neq(nil,nil),
inference(trivial_inequality_removal,[],[f751]) ).
fof(f751,plain,
( nil != nil
| neq(nil,nil) ),
inference(backward_demodulation,[],[f739,f746]) ).
fof(f746,plain,
nil = sK20,
inference(resolution,[],[f745,f375]) ).
fof(f375,plain,
ssList(sK20),
inference(cnf_transformation,[],[f253]) ).
fof(f253,plain,
( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f98,f252,f251,f250,f249]) ).
fof(f249,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f250,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK18
& nil = X1 ) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ( nil = sK20
& nil = sK21 ) )
& ( ( ! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK19,nil) )
| ( nil != sK18
& nil = sK19 ) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3
& 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] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f745,plain,
( ~ ssList(sK20)
| nil = sK20 ),
inference(duplicate_literal_removal,[],[f744]) ).
fof(f744,plain,
( nil = sK20
| nil = sK20
| ~ ssList(sK20) ),
inference(resolution,[],[f737,f555]) ).
fof(f555,plain,
! [X0] :
( ~ frontsegP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f348]) ).
fof(f348,plain,
! [X0] :
( ( ( frontsegP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ frontsegP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f176,plain,
! [X0] :
( ( frontsegP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f46]) ).
fof(f46,axiom,
! [X0] :
( ssList(X0)
=> ( frontsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax46) ).
fof(f737,plain,
( frontsegP(nil,sK20)
| nil = sK20 ),
inference(backward_demodulation,[],[f638,f735]) ).
fof(f735,plain,
nil = sK19,
inference(resolution,[],[f734,f375]) ).
fof(f734,plain,
( ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f732]) ).
fof(f732,plain,
( ~ ssList(sK20)
| nil = sK19
| nil = sK19 ),
inference(resolution,[],[f731,f640]) ).
fof(f640,plain,
( frontsegP(sK19,sK20)
| nil = sK19 ),
inference(forward_demodulation,[],[f639,f377]) ).
fof(f377,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f253]) ).
fof(f639,plain,
( frontsegP(sK19,sK20)
| nil = sK21 ),
inference(forward_demodulation,[],[f385,f377]) ).
fof(f385,plain,
( frontsegP(sK21,sK20)
| nil = sK21 ),
inference(cnf_transformation,[],[f253]) ).
fof(f731,plain,
( ~ frontsegP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f730]) ).
fof(f730,plain,
( ~ frontsegP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19
| ~ ssList(sK20) ),
inference(resolution,[],[f728,f453]) ).
fof(f453,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f728,plain,
( ~ frontsegP(sK20,sK20)
| ~ frontsegP(sK19,sK20)
| ~ ssList(sK20)
| nil = sK19 ),
inference(duplicate_literal_removal,[],[f726]) ).
fof(f726,plain,
( ~ frontsegP(sK19,sK20)
| ~ frontsegP(sK20,sK20)
| ~ ssList(sK20)
| nil = sK19
| nil = sK19 ),
inference(resolution,[],[f645,f641]) ).
fof(f641,plain,
( neq(sK20,nil)
| nil = sK19 ),
inference(forward_demodulation,[],[f383,f377]) ).
fof(f383,plain,
( neq(sK20,nil)
| nil = sK21 ),
inference(cnf_transformation,[],[f253]) ).
fof(f645,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK19,X4)
| ~ frontsegP(sK20,X4)
| ~ ssList(X4)
| nil = sK19 ),
inference(forward_demodulation,[],[f381,f378]) ).
fof(f378,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f253]) ).
fof(f381,plain,
! [X4] :
( ~ frontsegP(sK18,X4)
| ~ frontsegP(sK19,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK19 ),
inference(cnf_transformation,[],[f253]) ).
fof(f638,plain,
( frontsegP(sK19,sK20)
| nil = sK20 ),
inference(forward_demodulation,[],[f386,f377]) ).
fof(f386,plain,
( frontsegP(sK21,sK20)
| nil = sK20 ),
inference(cnf_transformation,[],[f253]) ).
fof(f739,plain,
( neq(nil,nil)
| nil != sK20 ),
inference(backward_demodulation,[],[f646,f735]) ).
fof(f646,plain,
( nil != sK20
| neq(sK19,nil) ),
inference(forward_demodulation,[],[f380,f378]) ).
fof(f380,plain,
( neq(sK19,nil)
| nil != sK18 ),
inference(cnf_transformation,[],[f253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC017+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 20:28:37 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.30 % (30418)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.32 % (30419)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.32 % (30421)WARNING: value z3 for option sas not known
% 0.14/0.32 % (30421)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.32 % (30420)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.32 % (30422)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.32 % (30424)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.32 % (30425)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.32 % (30423)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.33 TRYING [1]
% 0.14/0.33 TRYING [2]
% 0.14/0.33 % (30424)First to succeed.
% 0.14/0.33 TRYING [1]
% 0.14/0.34 % (30424)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30418"
% 0.14/0.34 TRYING [3]
% 0.14/0.34 % (30424)Refutation found. Thanks to Tanya!
% 0.14/0.34 % SZS status Theorem for theBenchmark
% 0.14/0.34 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.34 % (30424)------------------------------
% 0.14/0.34 % (30424)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.34 % (30424)Termination reason: Refutation
% 0.14/0.34
% 0.14/0.34 % (30424)Memory used [KB]: 1394
% 0.14/0.34 % (30424)Time elapsed: 0.015 s
% 0.14/0.34 % (30424)Instructions burned: 27 (million)
% 0.14/0.34 % (30418)Success in time 0.03 s
%------------------------------------------------------------------------------