TSTP Solution File: SWC020+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC020+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n027.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 : Wed May 1 03:59:14 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 265 ( 90 equ)
% Maximal formula atoms : 32 ( 6 avg)
% Number of connectives : 336 ( 112 ~; 99 |; 108 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 50 ( 24 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f213,plain,
$false,
inference(avatar_sat_refutation,[],[f165,f170,f175,f176,f177,f212]) ).
fof(f212,plain,
( ~ spl5_2
| ~ spl5_4 ),
inference(avatar_contradiction_clause,[],[f211]) ).
fof(f211,plain,
( $false
| ~ spl5_2
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f210,f126]) ).
fof(f126,plain,
ssList(sK2),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
( ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f101,f116,f115,f114,f113]) ).
fof(f113,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f115,plain,
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( frontsegP(X3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f116,plain,
( ? [X3] :
( ( ( frontsegP(X3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = X3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( frontsegP(sK3,sK2)
& neq(sK2,nil) )
| ( nil = sK2
& nil = sK3 ) )
& ( nil != sK0
| nil != sK1 )
& ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( frontsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& 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) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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) )
& ( nil != X2
| nil != X3 ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.9gkoLxqt3I/Vampire---4.8_9599',co1) ).
fof(f210,plain,
( ~ ssList(sK2)
| ~ spl5_2
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f209,f182]) ).
fof(f182,plain,
frontsegP(sK2,sK2),
inference(unit_resulting_resolution,[],[f126,f143]) ).
fof(f143,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,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.9gkoLxqt3I/Vampire---4.8_9599',ax42) ).
fof(f209,plain,
( ~ frontsegP(sK2,sK2)
| ~ ssList(sK2)
| ~ spl5_2
| ~ spl5_4 ),
inference(subsumption_resolution,[],[f199,f164]) ).
fof(f164,plain,
( frontsegP(sK3,sK2)
| ~ spl5_2 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f162,plain,
( spl5_2
<=> frontsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_2])]) ).
fof(f199,plain,
( ~ frontsegP(sK3,sK2)
| ~ frontsegP(sK2,sK2)
| ~ ssList(sK2)
| ~ spl5_4 ),
inference(resolution,[],[f150,f174]) ).
fof(f174,plain,
( neq(sK2,nil)
| ~ spl5_4 ),
inference(avatar_component_clause,[],[f172]) ).
fof(f172,plain,
( spl5_4
<=> neq(sK2,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_4])]) ).
fof(f150,plain,
! [X4] :
( ~ neq(X4,nil)
| ~ frontsegP(sK3,X4)
| ~ frontsegP(sK2,X4)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f130,f129,f128]) ).
fof(f128,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f117]) ).
fof(f129,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f117]) ).
fof(f130,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f117]) ).
fof(f177,plain,
( ~ spl5_3
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f149,f158,f167]) ).
fof(f167,plain,
( spl5_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
fof(f158,plain,
( spl5_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
fof(f149,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f131,f129,f128]) ).
fof(f131,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f117]) ).
fof(f176,plain,
( spl5_3
| spl5_4 ),
inference(avatar_split_clause,[],[f132,f172,f167]) ).
fof(f132,plain,
( neq(sK2,nil)
| nil = sK3 ),
inference(cnf_transformation,[],[f117]) ).
fof(f175,plain,
( spl5_1
| spl5_4 ),
inference(avatar_split_clause,[],[f133,f172,f158]) ).
fof(f133,plain,
( neq(sK2,nil)
| nil = sK2 ),
inference(cnf_transformation,[],[f117]) ).
fof(f170,plain,
( spl5_3
| spl5_2 ),
inference(avatar_split_clause,[],[f134,f162,f167]) ).
fof(f134,plain,
( frontsegP(sK3,sK2)
| nil = sK3 ),
inference(cnf_transformation,[],[f117]) ).
fof(f165,plain,
( spl5_1
| spl5_2 ),
inference(avatar_split_clause,[],[f135,f162,f158]) ).
fof(f135,plain,
( frontsegP(sK3,sK2)
| nil = sK2 ),
inference(cnf_transformation,[],[f117]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC020+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.35 % Computer : n027.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 : Tue Apr 30 18:48:03 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.35 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.9gkoLxqt3I/Vampire---4.8_9599
% 0.52/0.74 % (9842)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on Vampire---4 for (2996ds/83Mi)
% 0.52/0.74 % (9836)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2996ds/34Mi)
% 0.52/0.74 % (9838)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.52/0.74 % (9839)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.52/0.74 % (9837)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on Vampire---4 for (2996ds/51Mi)
% 0.52/0.74 % (9840)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2996ds/34Mi)
% 0.52/0.74 % (9841)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.52/0.75 % (9843)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.52/0.75 % (9839)First to succeed.
% 0.59/0.75 % (9836)Also succeeded, but the first one will report.
% 0.59/0.75 % (9838)Also succeeded, but the first one will report.
% 0.59/0.75 % (9839)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for Vampire---4
% 0.59/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.59/0.75 % (9839)------------------------------
% 0.59/0.75 % (9839)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.59/0.75 % (9839)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (9839)Memory used [KB]: 1153
% 0.59/0.75 % (9839)Time elapsed: 0.005 s
% 0.59/0.75 % (9839)Instructions burned: 6 (million)
% 0.59/0.75 % (9839)------------------------------
% 0.59/0.75 % (9839)------------------------------
% 0.59/0.75 % (9832)Success in time 0.388 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------