TSTP Solution File: SWC102+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC102+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 : n023.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:34 EDT 2023
% Result : Theorem 0.22s 0.43s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 153 ( 44 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 160 ( 40 ~; 27 |; 78 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 35 (; 11 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f598,plain,
$false,
inference(avatar_sat_refutation,[],[f577,f593,f597]) ).
fof(f597,plain,
spl51_2,
inference(avatar_contradiction_clause,[],[f596]) ).
fof(f596,plain,
( $false
| spl51_2 ),
inference(subsumption_resolution,[],[f595,f579]) ).
fof(f579,plain,
ssList(sK0),
inference(forward_demodulation,[],[f578,f341]) ).
fof(f341,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f227]) ).
fof(f227,plain,
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& sK2 = sK3
& 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] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil)
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil)
& X2 = X3
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& X2 = X3
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( ? [X3] :
( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& sK2 = X3
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil)
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& X2 = X3
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil)
& X2 = X3
& 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)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil)
| X2 != X3
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.0g2XV4TWLV/Vampire---4.8_16992',co1) ).
fof(f578,plain,
ssList(sK2),
inference(forward_demodulation,[],[f339,f342]) ).
fof(f342,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f227]) ).
fof(f339,plain,
ssList(sK3),
inference(cnf_transformation,[],[f227]) ).
fof(f595,plain,
( ~ ssList(sK0)
| spl51_2 ),
inference(resolution,[],[f594,f405]) ).
fof(f405,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.0g2XV4TWLV/Vampire---4.8_16992',ax42) ).
fof(f594,plain,
( ~ frontsegP(sK0,sK0)
| spl51_2 ),
inference(forward_demodulation,[],[f576,f583]) ).
fof(f583,plain,
sK0 = sK1,
inference(forward_demodulation,[],[f581,f341]) ).
fof(f581,plain,
sK1 = sK2,
inference(superposition,[],[f342,f340]) ).
fof(f340,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f227]) ).
fof(f576,plain,
( ~ frontsegP(sK1,sK0)
| spl51_2 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f574,plain,
( spl51_2
<=> frontsegP(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_2])]) ).
fof(f593,plain,
spl51_1,
inference(avatar_split_clause,[],[f589,f570]) ).
fof(f570,plain,
( spl51_1
<=> neq(sK0,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl51_1])]) ).
fof(f589,plain,
neq(sK0,nil),
inference(superposition,[],[f343,f583]) ).
fof(f343,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f227]) ).
fof(f577,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f344,f574,f570]) ).
fof(f344,plain,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) ),
inference(cnf_transformation,[],[f227]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC102+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.14 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 17:00:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.0g2XV4TWLV/Vampire---4.8_16992
% 0.14/0.36 % (17100)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.42 % (17104)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.22/0.42 % (17103)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.22/0.42 % (17105)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.22/0.42 % (17106)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.22/0.42 % (17102)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.22/0.42 % (17107)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.22/0.42 % (17101)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.22/0.43 % (17107)First to succeed.
% 0.22/0.43 % (17104)Also succeeded, but the first one will report.
% 0.22/0.43 % (17107)Refutation found. Thanks to Tanya!
% 0.22/0.43 % SZS status Theorem for Vampire---4
% 0.22/0.43 % SZS output start Proof for Vampire---4
% See solution above
% 0.22/0.43 % (17107)------------------------------
% 0.22/0.43 % (17107)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.22/0.43 % (17107)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.22/0.43 % (17107)Termination reason: Refutation
% 0.22/0.43
% 0.22/0.43 % (17107)Memory used [KB]: 5884
% 0.22/0.43 % (17107)Time elapsed: 0.008 s
% 0.22/0.43 % (17107)------------------------------
% 0.22/0.43 % (17107)------------------------------
% 0.22/0.43 % (17100)Success in time 0.07 s
% 0.22/0.43 % Vampire---4.8 exiting
%------------------------------------------------------------------------------