TSTP Solution File: SWC370+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC370+1 : TPTP v8.2.0. 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 : n004.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 May 21 04:38:30 EDT 2024
% Result : Theorem 0.65s 0.83s
% Output : Refutation 0.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 120 ( 35 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 136 ( 46 ~; 41 |; 32 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 54 ( 38 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f927,plain,
$false,
inference(subsumption_resolution,[],[f926,f188]) ).
fof(f188,plain,
~ segmentP(sK3,sK2),
inference(definition_unfolding,[],[f139,f137,f138]) ).
fof(f138,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,X0)
& ? [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] :
( ( nil != X2
| nil = X3 )
& ~ segmentP(X1,X0)
& ? [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)
=> ( ( nil = X2
& nil != X3 )
| segmentP(X1,X0)
| ! [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)
=> ( ( nil = X2
& nil != X3 )
| segmentP(X1,X0)
| ! [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/benchmark/theBenchmark.p',co1) ).
fof(f137,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f99]) ).
fof(f139,plain,
~ segmentP(sK1,sK0),
inference(cnf_transformation,[],[f99]) ).
fof(f926,plain,
segmentP(sK3,sK2),
inference(forward_demodulation,[],[f925,f133]) ).
fof(f133,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f99]) ).
fof(f925,plain,
segmentP(app(sK2,sK4),sK2),
inference(forward_demodulation,[],[f883,f334]) ).
fof(f334,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/benchmark/theBenchmark.p',ax28) ).
fof(f186,plain,
ssList(sK2),
inference(definition_unfolding,[],[f142,f138]) ).
fof(f142,plain,
ssList(sK0),
inference(cnf_transformation,[],[f99]) ).
fof(f883,plain,
segmentP(app(app(nil,sK2),sK4),sK2),
inference(unit_resulting_resolution,[],[f132,f165,f186,f186,f342,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/benchmark/theBenchmark.p',ax56) ).
fof(f342,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/benchmark/theBenchmark.p',ax55) ).
fof(f165,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f132,plain,
ssList(sK4),
inference(cnf_transformation,[],[f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC370+1 : TPTP v8.2.0. 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 : n004.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 : Sun May 19 03:54:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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/benchmark/theBenchmark.p
% 0.65/0.82 % (3590)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 theBenchmark for (2995ds/34Mi)
% 0.65/0.82 % (3592)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.65/0.82 % (3591)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 theBenchmark for (2995ds/51Mi)
% 0.65/0.82 % (3593)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.65/0.82 % (3594)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 theBenchmark for (2995ds/34Mi)
% 0.65/0.82 % (3595)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.65/0.82 % (3596)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 theBenchmark for (2995ds/83Mi)
% 0.65/0.82 % (3597)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.65/0.83 % (3596)First to succeed.
% 0.65/0.83 % (3596)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3580"
% 0.65/0.83 % (3593)Instruction limit reached!
% 0.65/0.83 % (3593)------------------------------
% 0.65/0.83 % (3593)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.83 % (3593)Termination reason: Unknown
% 0.65/0.83 % (3593)Termination phase: Saturation
% 0.65/0.83
% 0.65/0.83 % (3593)Memory used [KB]: 1728
% 0.65/0.83 % (3593)Time elapsed: 0.012 s
% 0.65/0.83 % (3593)Instructions burned: 34 (million)
% 0.65/0.83 % (3593)------------------------------
% 0.65/0.83 % (3593)------------------------------
% 0.65/0.83 % (3594)Instruction limit reached!
% 0.65/0.83 % (3594)------------------------------
% 0.65/0.83 % (3594)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.83 % (3594)Termination reason: Unknown
% 0.65/0.83 % (3594)Termination phase: Saturation
% 0.65/0.83
% 0.65/0.83 % (3594)Memory used [KB]: 1909
% 0.65/0.83 % (3594)Time elapsed: 0.012 s
% 0.65/0.83 % (3594)Instructions burned: 35 (million)
% 0.65/0.83 % (3594)------------------------------
% 0.65/0.83 % (3594)------------------------------
% 0.65/0.83 % (3596)Refutation found. Thanks to Tanya!
% 0.65/0.83 % SZS status Theorem for theBenchmark
% 0.65/0.83 % SZS output start Proof for theBenchmark
% See solution above
% 0.65/0.83 % (3596)------------------------------
% 0.65/0.83 % (3596)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.65/0.83 % (3596)Termination reason: Refutation
% 0.65/0.83
% 0.65/0.83 % (3596)Memory used [KB]: 1373
% 0.65/0.83 % (3596)Time elapsed: 0.011 s
% 0.65/0.83 % (3596)Instructions burned: 32 (million)
% 0.65/0.83 % (3580)Success in time 0.449 s
% 0.65/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------