TSTP Solution File: SWC331+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC331+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 : n016.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 04:01:29 EDT 2024
% Result : Theorem 0.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 38 ( 17 unt; 0 def)
% Number of atoms : 139 ( 35 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 154 ( 53 ~; 48 |; 34 &)
% ( 2 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 38 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f943,plain,
$false,
inference(avatar_sat_refutation,[],[f214,f215,f938]) ).
fof(f938,plain,
spl16_4,
inference(avatar_contradiction_clause,[],[f937]) ).
fof(f937,plain,
( $false
| spl16_4 ),
inference(subsumption_resolution,[],[f936,f213]) ).
fof(f213,plain,
( ~ segmentP(sK3,sK2)
| spl16_4 ),
inference(avatar_component_clause,[],[f211]) ).
fof(f211,plain,
( spl16_4
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_4])]) ).
fof(f936,plain,
segmentP(sK3,sK2),
inference(forward_demodulation,[],[f935,f133]) ).
fof(f133,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( app(X7,cons(X5,nil)) != X2
| ~ ssList(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& equalelemsP(X2)
& app(X2,X4) = X3
& 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)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QAKLxVVWdg/Vampire---4.8_27987',co1) ).
fof(f935,plain,
segmentP(app(sK2,sK4),sK2),
inference(forward_demodulation,[],[f893,f344]) ).
fof(f344,plain,
sK2 = app(nil,sK2),
inference(unit_resulting_resolution,[],[f186,f163]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.QAKLxVVWdg/Vampire---4.8_27987',ax28) ).
fof(f186,plain,
ssList(sK2),
inference(definition_unfolding,[],[f142,f139]) ).
fof(f139,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f99]) ).
fof(f142,plain,
ssList(sK0),
inference(cnf_transformation,[],[f99]) ).
fof(f893,plain,
segmentP(app(app(nil,sK2),sK4),sK2),
inference(unit_resulting_resolution,[],[f132,f165,f186,f186,f352,f169]) ).
fof(f169,plain,
! [X2,X3,X0,X1] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QAKLxVVWdg/Vampire---4.8_27987',ax56) ).
fof(f352,plain,
segmentP(sK2,sK2),
inference(unit_resulting_resolution,[],[f186,f170]) ).
fof(f170,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f122]) ).
fof(f122,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/tmp/tmp.QAKLxVVWdg/Vampire---4.8_27987',ax55) ).
fof(f165,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.QAKLxVVWdg/Vampire---4.8_27987',ax17) ).
fof(f132,plain,
ssList(sK4),
inference(cnf_transformation,[],[f99]) ).
fof(f215,plain,
spl16_3,
inference(avatar_split_clause,[],[f134,f207]) ).
fof(f207,plain,
( spl16_3
<=> equalelemsP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl16_3])]) ).
fof(f134,plain,
equalelemsP(sK2),
inference(cnf_transformation,[],[f99]) ).
fof(f214,plain,
( ~ spl16_3
| ~ spl16_4 ),
inference(avatar_split_clause,[],[f188,f211,f207]) ).
fof(f188,plain,
( ~ segmentP(sK3,sK2)
| ~ equalelemsP(sK2) ),
inference(definition_unfolding,[],[f135,f138,f139,f139]) ).
fof(f138,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f99]) ).
fof(f135,plain,
( ~ segmentP(sK1,sK0)
| ~ equalelemsP(sK0) ),
inference(cnf_transformation,[],[f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC331+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.15 % 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.15/0.36 % Computer : n016.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:54:26 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.37 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.QAKLxVVWdg/Vampire---4.8_27987
% 0.55/0.75 % (28254)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.55/0.75 % (28248)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.55/0.75 % (28250)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.55/0.75 % (28251)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.55/0.75 % (28252)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.55/0.75 % (28249)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.55/0.75 % (28253)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.55/0.75 % (28255)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.55/0.75 % (28254)First to succeed.
% 0.55/0.76 % (28254)Refutation found. Thanks to Tanya!
% 0.55/0.76 % SZS status Theorem for Vampire---4
% 0.55/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.76 % (28254)------------------------------
% 0.55/0.76 % (28254)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.76 % (28254)Termination reason: Refutation
% 0.55/0.76
% 0.55/0.76 % (28254)Memory used [KB]: 1369
% 0.55/0.76 % (28254)Time elapsed: 0.011 s
% 0.55/0.76 % (28254)Instructions burned: 33 (million)
% 0.55/0.76 % (28254)------------------------------
% 0.55/0.76 % (28254)------------------------------
% 0.55/0.76 % (28244)Success in time 0.376 s
% 0.55/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------