TSTP Solution File: SWC006+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC006+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 : n026.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:10 EDT 2024
% Result : Theorem 0.14s 0.41s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 11 unt; 0 def)
% Number of atoms : 254 ( 102 equ)
% Maximal formula atoms : 32 ( 8 avg)
% Number of connectives : 319 ( 94 ~; 75 |; 128 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 7 avg)
% Maximal term depth : 3 ( 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 : 119 ( 54 !; 65 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1045,plain,
$false,
inference(resolution,[],[f1044,f384]) ).
fof(f384,plain,
ssList(sK22),
inference(cnf_transformation,[],[f257]) ).
fof(f257,plain,
( sK20 = app(sK22,sK24)
& sK21 = app(app(sK22,sK23),sK24)
& ssList(sK24)
& ssList(sK23)
& ssList(sK22)
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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,sK24])],[f99,f256,f255,f254,f253,f252,f251,f250]) ).
fof(f250,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK20
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK20
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK20
& app(app(X4,X5),X6) = sK21
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != sK18
| app(app(X7,X8),X9) != sK19
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f254,plain,
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = sK20
& app(app(X4,X5),X6) = sK21
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ? [X6] :
( sK20 = app(sK22,X6)
& sK21 = app(app(sK22,X5),X6)
& ssList(X6) )
& ssList(X5) )
& ssList(sK22) ) ),
introduced(choice_axiom,[]) ).
fof(f255,plain,
( ? [X5] :
( ? [X6] :
( sK20 = app(sK22,X6)
& sK21 = app(app(sK22,X5),X6)
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK20 = app(sK22,X6)
& sK21 = app(app(sK22,sK23),X6)
& ssList(X6) )
& ssList(sK23) ) ),
introduced(choice_axiom,[]) ).
fof(f256,plain,
( ? [X6] :
( sK20 = app(sK22,X6)
& sK21 = app(app(sK22,sK23),X6)
& ssList(X6) )
=> ( sK20 = app(sK22,sK24)
& sK21 = app(app(sK22,sK23),sK24)
& ssList(sK24) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X2
& app(app(X4,X5),X6) = X3
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
& ! [X7] :
( ! [X8] :
( ! [X9] :
( app(X7,X9) != X0
| app(app(X7,X8),X9) != X1
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssList(X7) )
& 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] :
( ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X4,X6) != X2
| app(app(X4,X5),X6) != X3
| ~ ssList(X6) ) ) )
| ? [X7] :
( ? [X8] :
( ? [X9] :
( app(X7,X9) = X0
& app(app(X7,X8),X9) = X1
& ssList(X9) )
& ssList(X8) )
& ssList(X7) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X7] :
( ssList(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( app(X7,X9) != X2
| app(app(X7,X8),X9) != X3
| ~ ssList(X9) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f1044,plain,
~ ssList(sK22),
inference(resolution,[],[f1043,f386]) ).
fof(f386,plain,
ssList(sK24),
inference(cnf_transformation,[],[f257]) ).
fof(f1043,plain,
( ~ ssList(sK24)
| ~ ssList(sK22) ),
inference(resolution,[],[f1042,f385]) ).
fof(f385,plain,
ssList(sK23),
inference(cnf_transformation,[],[f257]) ).
fof(f1042,plain,
( ~ ssList(sK23)
| ~ ssList(sK24)
| ~ ssList(sK22) ),
inference(trivial_inequality_removal,[],[f1041]) ).
fof(f1041,plain,
( sK18 != sK18
| ~ ssList(sK24)
| ~ ssList(sK23)
| ~ ssList(sK22) ),
inference(forward_demodulation,[],[f1027,f640]) ).
fof(f640,plain,
sK18 = app(sK22,sK24),
inference(forward_demodulation,[],[f388,f382]) ).
fof(f382,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f257]) ).
fof(f388,plain,
sK20 = app(sK22,sK24),
inference(cnf_transformation,[],[f257]) ).
fof(f1027,plain,
( sK18 != app(sK22,sK24)
| ~ ssList(sK24)
| ~ ssList(sK23)
| ~ ssList(sK22) ),
inference(trivial_inequality_removal,[],[f1026]) ).
fof(f1026,plain,
( sK19 != sK19
| sK18 != app(sK22,sK24)
| ~ ssList(sK24)
| ~ ssList(sK23)
| ~ ssList(sK22) ),
inference(superposition,[],[f383,f641]) ).
fof(f641,plain,
sK19 = app(app(sK22,sK23),sK24),
inference(forward_demodulation,[],[f387,f381]) ).
fof(f381,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f257]) ).
fof(f387,plain,
sK21 = app(app(sK22,sK23),sK24),
inference(cnf_transformation,[],[f257]) ).
fof(f383,plain,
! [X8,X9,X7] :
( app(app(X7,X8),X9) != sK19
| app(X7,X9) != sK18
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssList(X7) ),
inference(cnf_transformation,[],[f257]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWC006+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n026.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 : Fri May 3 20:33:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (31376)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38 % (31379)WARNING: value z3 for option sas not known
% 0.14/0.38 % (31378)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 % (31380)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (31383)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 % (31382)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 % (31381)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 % (31379)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 % (31377)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 [2]
% 0.14/0.40 TRYING [1]
% 0.14/0.40 TRYING [2]
% 0.14/0.40 % (31382)First to succeed.
% 0.14/0.40 TRYING [3]
% 0.14/0.40 % (31382)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-31376"
% 0.14/0.41 % (31382)Refutation found. Thanks to Tanya!
% 0.14/0.41 % SZS status Theorem for theBenchmark
% 0.14/0.41 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.41 % (31382)------------------------------
% 0.14/0.41 % (31382)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.14/0.41 % (31382)Termination reason: Refutation
% 0.14/0.41
% 0.14/0.41 % (31382)Memory used [KB]: 1643
% 0.14/0.41 % (31382)Time elapsed: 0.025 s
% 0.14/0.41 % (31382)Instructions burned: 47 (million)
% 0.14/0.41 % (31376)Success in time 0.044 s
%------------------------------------------------------------------------------