TSTP Solution File: SWC007+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC007+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 : n002.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 15:46:19 EDT 2024
% Result : Theorem 0.22s 0.41s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 13 unt; 0 def)
% Number of atoms : 201 ( 90 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 264 ( 99 ~; 78 |; 73 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 84 ( 54 !; 30 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1023,plain,
$false,
inference(resolution,[],[f1022,f636]) ).
fof(f636,plain,
ssList(nil),
inference(forward_demodulation,[],[f376,f378]) ).
fof(f378,plain,
nil = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& nil = sK20
& ssList(sK21)
& ssList(sK20)
& ssList(sK19)
& ssList(sK18) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = X2
& sK19 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = X2
& sK19 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = X3
& nil = sK20
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = X3
& nil = sK20
& ssList(X3) )
=> ( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& sK18 = sK20
& sK19 = sK21
& nil = sK20
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ! [X5] :
( ! [X6] :
( app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& nil = X2
& 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)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
fof(f1022,plain,
~ ssList(nil),
inference(resolution,[],[f1021,f635]) ).
fof(f635,plain,
ssList(sK19),
inference(forward_demodulation,[],[f377,f379]) ).
fof(f379,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f1021,plain,
( ~ ssList(sK19)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f1020]) ).
fof(f1020,plain,
( nil != nil
| ~ ssList(nil)
| ~ ssList(sK19) ),
inference(forward_demodulation,[],[f1019,f638]) ).
fof(f638,plain,
nil = app(nil,nil),
inference(resolution,[],[f452,f636]) ).
fof(f452,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/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f1019,plain,
( nil != app(nil,nil)
| ~ ssList(nil)
| ~ ssList(sK19) ),
inference(trivial_inequality_removal,[],[f1018]) ).
fof(f1018,plain,
( sK19 != sK19
| nil != app(nil,nil)
| ~ ssList(nil)
| ~ ssList(sK19) ),
inference(duplicate_literal_removal,[],[f1017]) ).
fof(f1017,plain,
( sK19 != sK19
| nil != app(nil,nil)
| ~ ssList(nil)
| ~ ssList(sK19)
| ~ ssList(nil) ),
inference(superposition,[],[f973,f639]) ).
fof(f639,plain,
sK19 = app(sK19,nil),
inference(resolution,[],[f452,f635]) ).
fof(f973,plain,
! [X0] :
( sK19 != app(sK19,X0)
| nil != app(nil,X0)
| ~ ssList(X0)
| ~ ssList(sK19)
| ~ ssList(nil) ),
inference(superposition,[],[f634,f661]) ).
fof(f661,plain,
sK19 = app(nil,sK19),
inference(resolution,[],[f453,f635]) ).
fof(f453,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/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f634,plain,
! [X6,X4,X5] :
( app(app(X4,X5),X6) != sK19
| nil != app(X4,X6)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(forward_demodulation,[],[f381,f633]) ).
fof(f633,plain,
nil = sK18,
inference(backward_demodulation,[],[f380,f378]) ).
fof(f380,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f381,plain,
! [X6,X4,X5] :
( app(X4,X6) != sK18
| app(app(X4,X5),X6) != sK19
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWC007+1 : TPTP v8.1.2. Released v2.4.0.
% 0.09/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 04:26:25 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (26820)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (26823)WARNING: value z3 for option sas not known
% 0.14/0.38 % (26824)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (26822)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 % (26821)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (26823)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 % (26825)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 % (26826)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 % (26827)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.40 TRYING [1]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 TRYING [2]
% 0.14/0.41 TRYING [3]
% 0.14/0.41 % (26826)First to succeed.
% 0.22/0.41 % (26824)Also succeeded, but the first one will report.
% 0.22/0.41 % (26826)Refutation found. Thanks to Tanya!
% 0.22/0.41 % SZS status Theorem for theBenchmark
% 0.22/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.41 % (26826)------------------------------
% 0.22/0.41 % (26826)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.41 % (26826)Termination reason: Refutation
% 0.22/0.41
% 0.22/0.41 % (26826)Memory used [KB]: 1652
% 0.22/0.41 % (26826)Time elapsed: 0.028 s
% 0.22/0.41 % (26826)Instructions burned: 47 (million)
% 0.22/0.41 % (26826)------------------------------
% 0.22/0.41 % (26826)------------------------------
% 0.22/0.41 % (26820)Success in time 0.036 s
%------------------------------------------------------------------------------