TSTP Solution File: SWC131+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC131+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 : 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 : Thu Aug 31 20:56:49 EDT 2023
% Result : Theorem 0.23s 0.44s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 12 unt; 0 def)
% Number of atoms : 131 ( 37 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 147 ( 45 ~; 20 |; 66 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 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 : 40 (; 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f581,plain,
$false,
inference(subsumption_resolution,[],[f580,f351]) ).
fof(f351,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox2/tmp/tmp.rC7r65UcW6/Vampire---4.8_11993',ax60) ).
fof(f580,plain,
~ cyclefreeP(nil),
inference(superposition,[],[f343,f576]) ).
fof(f576,plain,
nil = sK1,
inference(subsumption_resolution,[],[f575,f568]) ).
fof(f568,plain,
ssList(sK1),
inference(forward_demodulation,[],[f339,f340]) ).
fof(f340,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f227]) ).
fof(f227,plain,
( ~ cyclefreeP(sK1)
& ~ neq(sK3,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] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK1)
& ~ neq(X3,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK1)
& ~ neq(X3,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ cyclefreeP(sK1)
& ~ neq(X3,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( ? [X3] :
( ~ cyclefreeP(sK1)
& ~ neq(X3,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ cyclefreeP(sK1)
& ~ neq(sK3,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,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)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.rC7r65UcW6/Vampire---4.8_11993',co1) ).
fof(f339,plain,
ssList(sK3),
inference(cnf_transformation,[],[f227]) ).
fof(f575,plain,
( ~ ssList(sK1)
| nil = sK1 ),
inference(forward_demodulation,[],[f574,f340]) ).
fof(f574,plain,
( nil = sK1
| ~ ssList(sK3) ),
inference(forward_demodulation,[],[f573,f340]) ).
fof(f573,plain,
( nil = sK3
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f570,f352]) ).
fof(f352,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.rC7r65UcW6/Vampire---4.8_11993',ax17) ).
fof(f570,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(resolution,[],[f342,f505]) ).
fof(f505,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.rC7r65UcW6/Vampire---4.8_11993',ax15) ).
fof(f342,plain,
~ neq(sK3,nil),
inference(cnf_transformation,[],[f227]) ).
fof(f343,plain,
~ cyclefreeP(sK1),
inference(cnf_transformation,[],[f227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC131+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.16/0.36 % Computer : n029.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Mon Aug 28 18:35:26 EDT 2023
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/tmp/tmp.rC7r65UcW6/Vampire---4.8_11993
% 0.16/0.37 % (12100)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.43 % (12105)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.23/0.43 % (12102)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.23/0.44 % (12107)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.23/0.44 % (12103)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.23/0.44 % (12107)First to succeed.
% 0.23/0.44 % (12107)Refutation found. Thanks to Tanya!
% 0.23/0.44 % SZS status Theorem for Vampire---4
% 0.23/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.44 % (12107)------------------------------
% 0.23/0.44 % (12107)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.23/0.44 % (12107)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.23/0.44 % (12107)Termination reason: Refutation
% 0.23/0.44
% 0.23/0.44 % (12107)Memory used [KB]: 5884
% 0.23/0.44 % (12107)Time elapsed: 0.008 s
% 0.23/0.44 % (12107)------------------------------
% 0.23/0.44 % (12107)------------------------------
% 0.23/0.44 % (12100)Success in time 0.071 s
% 0.23/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------