TSTP Solution File: SWC030+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC030+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 : n029.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:52:05 EDT 2024
% Result : Theorem 0.22s 0.43s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 10
% Syntax : Number of formulae : 69 ( 27 unt; 0 def)
% Number of atoms : 310 ( 199 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 322 ( 81 ~; 79 |; 138 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 78 ( 30 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1712,plain,
$false,
inference(trivial_inequality_removal,[],[f1711]) ).
fof(f1711,plain,
nil != nil,
inference(superposition,[],[f1526,f1671]) ).
fof(f1671,plain,
nil = sK19,
inference(backward_demodulation,[],[f675,f1670]) ).
fof(f1670,plain,
nil = app(nil,sK19),
inference(forward_demodulation,[],[f1572,f1574]) ).
fof(f1574,plain,
sK19 = sK22,
inference(backward_demodulation,[],[f650,f1553]) ).
fof(f1553,plain,
sK19 = app(sK22,nil),
inference(backward_demodulation,[],[f642,f1551]) ).
fof(f1551,plain,
nil = sK23,
inference(resolution,[],[f1550,f382]) ).
fof(f382,plain,
ssList(sK22),
inference(cnf_transformation,[],[f256]) ).
fof(f256,plain,
( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& sK20 = app(sK23,sK22)
& sK21 = app(sK22,sK23)
& ssList(sK23)
& ssList(sK22)
& 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] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK18 )
| ( nil != sK18
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK18 )
| ( nil != sK18
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK20
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK20
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( nil != sK19
& nil = sK18 )
| ( nil != sK18
& nil = sK19 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = sK20
& app(X4,X5) = sK21
& ssList(X5) )
& ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ? [X5] :
( app(X5,X4) = sK20
& app(X4,X5) = sK21
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( sK20 = app(X5,sK22)
& sK21 = app(sK22,X5)
& ssList(X5) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X5] :
( sK20 = app(X5,sK22)
& sK21 = app(sK22,X5)
& ssList(X5) )
=> ( sK20 = app(sK23,sK22)
& sK21 = app(sK22,sK23)
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ? [X4] :
( ? [X5] :
( app(X5,X4) = X2
& app(X4,X5) = X3
& ssList(X5) )
& ssList(X4) )
& 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] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,X4) != X2
| app(X4,X5) != X3 ) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1550,plain,
( ~ ssList(sK22)
| nil = sK23 ),
inference(resolution,[],[f1524,f383]) ).
fof(f383,plain,
ssList(sK23),
inference(cnf_transformation,[],[f256]) ).
fof(f1524,plain,
( ~ ssList(sK23)
| ~ ssList(sK22)
| nil = sK23 ),
inference(trivial_inequality_removal,[],[f1523]) ).
fof(f1523,plain,
( nil != nil
| nil = sK23
| ~ ssList(sK22)
| ~ ssList(sK23) ),
inference(backward_demodulation,[],[f1437,f1499]) ).
fof(f1499,plain,
nil = sK18,
inference(duplicate_literal_removal,[],[f1468]) ).
fof(f1468,plain,
( nil = sK18
| nil = sK18
| nil = sK18 ),
inference(superposition,[],[f1425,f386]) ).
fof(f386,plain,
( nil = sK19
| nil = sK18 ),
inference(cnf_transformation,[],[f256]) ).
fof(f1425,plain,
( sK18 = sK19
| nil = sK18 ),
inference(forward_demodulation,[],[f1424,f648]) ).
fof(f648,plain,
sK18 = app(sK18,nil),
inference(resolution,[],[f460,f644]) ).
fof(f644,plain,
ssList(sK18),
inference(forward_demodulation,[],[f378,f381]) ).
fof(f381,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f256]) ).
fof(f378,plain,
ssList(sK20),
inference(cnf_transformation,[],[f256]) ).
fof(f460,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax84) ).
fof(f1424,plain,
( sK19 = app(sK18,nil)
| nil = sK18 ),
inference(duplicate_literal_removal,[],[f1419]) ).
fof(f1419,plain,
( sK19 = app(sK18,nil)
| nil = sK18
| nil = sK18 ),
inference(superposition,[],[f1367,f1386]) ).
fof(f1386,plain,
( sK18 = sK22
| nil = sK18 ),
inference(superposition,[],[f1366,f676]) ).
fof(f676,plain,
sK22 = app(nil,sK22),
inference(resolution,[],[f461,f382]) ).
fof(f461,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax28) ).
fof(f1366,plain,
( sK18 = app(nil,sK22)
| nil = sK18 ),
inference(superposition,[],[f641,f1364]) ).
fof(f1364,plain,
( nil = sK23
| nil = sK18 ),
inference(resolution,[],[f1363,f382]) ).
fof(f1363,plain,
( ~ ssList(sK22)
| nil = sK23
| nil = sK18 ),
inference(resolution,[],[f1362,f383]) ).
fof(f1362,plain,
( ~ ssList(sK23)
| nil = sK23
| ~ ssList(sK22)
| nil = sK18 ),
inference(trivial_inequality_removal,[],[f1361]) ).
fof(f1361,plain,
( nil != nil
| nil = sK23
| ~ ssList(sK23)
| ~ ssList(sK22)
| nil = sK18 ),
inference(superposition,[],[f1357,f386]) ).
fof(f1357,plain,
( nil != sK19
| nil = sK23
| ~ ssList(sK23)
| ~ ssList(sK22) ),
inference(superposition,[],[f589,f642]) ).
fof(f589,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f372]) ).
fof(f372,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f371]) ).
fof(f371,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f202]) ).
fof(f202,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax83) ).
fof(f641,plain,
sK18 = app(sK23,sK22),
inference(forward_demodulation,[],[f385,f381]) ).
fof(f385,plain,
sK20 = app(sK23,sK22),
inference(cnf_transformation,[],[f256]) ).
fof(f1367,plain,
( sK19 = app(sK22,nil)
| nil = sK18 ),
inference(superposition,[],[f642,f1364]) ).
fof(f1437,plain,
( nil != sK18
| nil = sK23
| ~ ssList(sK22)
| ~ ssList(sK23) ),
inference(superposition,[],[f590,f641]) ).
fof(f590,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f372]) ).
fof(f642,plain,
sK19 = app(sK22,sK23),
inference(forward_demodulation,[],[f384,f380]) ).
fof(f380,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f256]) ).
fof(f384,plain,
sK21 = app(sK22,sK23),
inference(cnf_transformation,[],[f256]) ).
fof(f650,plain,
sK22 = app(sK22,nil),
inference(resolution,[],[f460,f382]) ).
fof(f1572,plain,
nil = app(nil,sK22),
inference(backward_demodulation,[],[f1502,f1551]) ).
fof(f1502,plain,
nil = app(sK23,sK22),
inference(backward_demodulation,[],[f641,f1499]) ).
fof(f675,plain,
sK19 = app(nil,sK19),
inference(resolution,[],[f461,f643]) ).
fof(f643,plain,
ssList(sK19),
inference(forward_demodulation,[],[f379,f380]) ).
fof(f379,plain,
ssList(sK21),
inference(cnf_transformation,[],[f256]) ).
fof(f1526,plain,
nil != sK19,
inference(trivial_inequality_removal,[],[f1501]) ).
fof(f1501,plain,
( nil != nil
| nil != sK19 ),
inference(backward_demodulation,[],[f389,f1499]) ).
fof(f389,plain,
( nil != sK19
| nil != sK18 ),
inference(cnf_transformation,[],[f256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC030+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n029.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 20:25:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 % (16993)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (16996)WARNING: value z3 for option sas not known
% 0.15/0.38 % (16995)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 % (16996)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.38 % (16994)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (16997)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38 % (16998)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 % (16999)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 % (17000)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.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 TRYING [3]
% 0.15/0.41 TRYING [3]
% 0.22/0.42 TRYING [1]
% 0.22/0.43 TRYING [2]
% 0.22/0.43 % (16999)First to succeed.
% 0.22/0.43 % (16999)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16993"
% 0.22/0.43 % (16999)Refutation found. Thanks to Tanya!
% 0.22/0.43 % SZS status Theorem for theBenchmark
% 0.22/0.43 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.43 % (16999)------------------------------
% 0.22/0.43 % (16999)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.43 % (16999)Termination reason: Refutation
% 0.22/0.43
% 0.22/0.43 % (16999)Memory used [KB]: 1934
% 0.22/0.43 % (16999)Time elapsed: 0.048 s
% 0.22/0.43 % (16999)Instructions burned: 83 (million)
% 0.22/0.43 % (16993)Success in time 0.068 s
%------------------------------------------------------------------------------