TSTP Solution File: SWC205+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC205+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n018.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 : Thu Aug 31 20:57:26 EDT 2023
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 39 ( 13 unt; 0 def)
% Number of atoms : 202 ( 96 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 231 ( 68 ~; 53 |; 92 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 40 (; 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f599,plain,
$false,
inference(avatar_sat_refutation,[],[f579,f588,f598]) ).
fof(f598,plain,
~ spl51_2,
inference(avatar_contradiction_clause,[],[f597]) ).
fof(f597,plain,
( $false
| ~ spl51_2 ),
inference(subsumption_resolution,[],[f595,f593]) ).
fof(f593,plain,
~ neq(nil,nil),
inference(superposition,[],[f343,f585]) ).
fof(f585,plain,
nil = sK0,
inference(subsumption_resolution,[],[f584,f581]) ).
fof(f581,plain,
ssList(sK0),
inference(forward_demodulation,[],[f338,f341]) ).
fof(f341,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f227]) ).
fof(f227,plain,
( ( nil != sK3
| nil = sK2 )
& ( nil != sK2
| nil = sK3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f226,f225,f224,f223]) ).
fof(f223,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != X3
| nil = sK2 )
& ( nil != sK2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( ? [X3] :
( ( nil != X3
| nil = sK2 )
& ( nil != sK2
| nil = X3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK3
| nil = sK2 )
& ( nil != sK2
| nil = sK3 )
& ~ neq(sK0,nil)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& neq(X1,nil)
& 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 = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SS75Dqw2Oy/Vampire---4.8_16296',co1) ).
fof(f338,plain,
ssList(sK2),
inference(cnf_transformation,[],[f227]) ).
fof(f584,plain,
( nil = sK0
| ~ ssList(sK0) ),
inference(subsumption_resolution,[],[f582,f354]) ).
fof(f354,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.SS75Dqw2Oy/Vampire---4.8_16296',ax17) ).
fof(f582,plain,
( nil = sK0
| ~ ssList(nil)
| ~ ssList(sK0) ),
inference(resolution,[],[f343,f507]) ).
fof(f507,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,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/sandbox2/tmp/tmp.SS75Dqw2Oy/Vampire---4.8_16296',ax15) ).
fof(f343,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f227]) ).
fof(f595,plain,
( neq(nil,nil)
| ~ spl51_2 ),
inference(superposition,[],[f342,f591]) ).
fof(f591,plain,
( nil = sK1
| ~ spl51_2 ),
inference(superposition,[],[f576,f340]) ).
fof(f340,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f227]) ).
fof(f576,plain,
( nil = sK3
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f575]) ).
fof(f575,plain,
( spl51_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).
fof(f342,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f227]) ).
fof(f588,plain,
spl51_1,
inference(avatar_contradiction_clause,[],[f587]) ).
fof(f587,plain,
( $false
| spl51_1 ),
inference(subsumption_resolution,[],[f586,f585]) ).
fof(f586,plain,
( nil != sK0
| spl51_1 ),
inference(superposition,[],[f572,f341]) ).
fof(f572,plain,
( nil != sK2
| spl51_1 ),
inference(avatar_component_clause,[],[f571]) ).
fof(f571,plain,
( spl51_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f579,plain,
( spl51_2
| ~ spl51_1 ),
inference(avatar_split_clause,[],[f344,f571,f575]) ).
fof(f344,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC205+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.36 % Computer : n018.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 : Mon Aug 28 18:42:02 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.SS75Dqw2Oy/Vampire---4.8_16296
% 0.14/0.37 % (16403)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.43 % (16408)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.21/0.43 % (16409)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.21/0.43 % (16407)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.21/0.43 % (16406)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.21/0.43 % (16405)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.21/0.43 % (16404)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.21/0.43 % (16410)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.21/0.43 % (16410)First to succeed.
% 0.21/0.44 % (16410)Refutation found. Thanks to Tanya!
% 0.21/0.44 % SZS status Theorem for Vampire---4
% 0.21/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.21/0.44 % (16410)------------------------------
% 0.21/0.44 % (16410)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.21/0.44 % (16410)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.21/0.44 % (16410)Termination reason: Refutation
% 0.21/0.44
% 0.21/0.44 % (16410)Memory used [KB]: 5884
% 0.21/0.44 % (16410)Time elapsed: 0.009 s
% 0.21/0.44 % (16410)------------------------------
% 0.21/0.44 % (16410)------------------------------
% 0.21/0.44 % (16403)Success in time 0.072 s
% 0.21/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------