TSTP Solution File: SWC103+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWC103+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 : n019.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:53:52 EDT 2024
% Result : Theorem 0.21s 0.40s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 204 ( 54 equ)
% Maximal formula atoms : 28 ( 6 avg)
% Number of connectives : 240 ( 67 ~; 52 |; 104 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 32 ( 8 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f667,plain,
$false,
inference(avatar_sat_refutation,[],[f645,f650,f655,f660,f665,f666]) ).
fof(f666,plain,
( ~ spl69_4
| ~ spl69_5 ),
inference(avatar_split_clause,[],[f602,f662,f657]) ).
fof(f657,plain,
( spl69_4
<=> neq(sK20,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_4])]) ).
fof(f662,plain,
( spl69_5
<=> frontsegP(sK21,sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_5])]) ).
fof(f602,plain,
( ~ frontsegP(sK21,sK20)
| ~ neq(sK20,nil) ),
inference(definition_unfolding,[],[f382,f378,f379,f379]) ).
fof(f379,plain,
sK18 = sK20,
inference(cnf_transformation,[],[f254]) ).
fof(f254,plain,
( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ~ neq(sK21,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK21
| nil = sK20 )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& 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] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK18) ) ),
introduced(choice_axiom,[]) ).
fof(f251,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& sK18 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK19) ) ),
introduced(choice_axiom,[]) ).
fof(f252,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = X2 )
& neq(sK19,nil)
& sK18 = X2
& sK19 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = sK20 )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
& ssList(sK20) ) ),
introduced(choice_axiom,[]) ).
fof(f253,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK20)
& neq(sK20,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != X3
| nil = sK20 )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK21,sK20)
& neq(sK20,nil) )
| ~ neq(sK21,nil) )
& ( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) )
& ( nil != sK21
| nil = sK20 )
& neq(sK19,nil)
& sK18 = sK20
& sK19 = sK21
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& 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] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& ( nil != X3
| nil = X2 )
& 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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ 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)
=> ( ( ( ~ frontsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( frontsegP(X1,X0)
& neq(X0,nil) )
| ( nil = X3
& nil != X2 )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f378,plain,
sK19 = sK21,
inference(cnf_transformation,[],[f254]) ).
fof(f382,plain,
( ~ frontsegP(sK19,sK18)
| ~ neq(sK18,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f665,plain,
( ~ spl69_3
| spl69_5 ),
inference(avatar_split_clause,[],[f384,f662,f652]) ).
fof(f652,plain,
( spl69_3
<=> neq(sK21,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_3])]) ).
fof(f384,plain,
( frontsegP(sK21,sK20)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f660,plain,
( ~ spl69_3
| spl69_4 ),
inference(avatar_split_clause,[],[f383,f657,f652]) ).
fof(f383,plain,
( neq(sK20,nil)
| ~ neq(sK21,nil) ),
inference(cnf_transformation,[],[f254]) ).
fof(f655,plain,
spl69_3,
inference(avatar_split_clause,[],[f603,f652]) ).
fof(f603,plain,
neq(sK21,nil),
inference(definition_unfolding,[],[f380,f378]) ).
fof(f380,plain,
neq(sK19,nil),
inference(cnf_transformation,[],[f254]) ).
fof(f650,plain,
spl69_2,
inference(avatar_split_clause,[],[f377,f647]) ).
fof(f647,plain,
( spl69_2
<=> ssList(sK21) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_2])]) ).
fof(f377,plain,
ssList(sK21),
inference(cnf_transformation,[],[f254]) ).
fof(f645,plain,
spl69_1,
inference(avatar_split_clause,[],[f376,f642]) ).
fof(f642,plain,
( spl69_1
<=> ssList(sK20) ),
introduced(avatar_definition,[new_symbols(naming,[spl69_1])]) ).
fof(f376,plain,
ssList(sK20),
inference(cnf_transformation,[],[f254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC103+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36 % Computer : n019.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:11:44 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 % (19532)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.38 % (19535)WARNING: value z3 for option sas not known
% 0.21/0.38 % (19533)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.38 % (19536)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.38 % (19538)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.21/0.38 % (19537)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.21/0.38 % (19534)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.38 % (19539)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.21/0.38 % (19535)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.21/0.39 % (19537)First to succeed.
% 0.21/0.39 % (19538)Also succeeded, but the first one will report.
% 0.21/0.40 % (19537)Refutation found. Thanks to Tanya!
% 0.21/0.40 % SZS status Theorem for theBenchmark
% 0.21/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40 % (19537)------------------------------
% 0.21/0.40 % (19537)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.21/0.40 % (19537)Termination reason: Refutation
% 0.21/0.40
% 0.21/0.40 % (19537)Memory used [KB]: 1235
% 0.21/0.40 % (19537)Time elapsed: 0.011 s
% 0.21/0.40 % (19537)Instructions burned: 17 (million)
% 0.21/0.40 % (19537)------------------------------
% 0.21/0.40 % (19537)------------------------------
% 0.21/0.40 % (19532)Success in time 0.031 s
%------------------------------------------------------------------------------