TSTP Solution File: SWC102+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC102+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 : n015.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:36:14 EDT 2024
% Result : Theorem 0.60s 0.77s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 61 ( 16 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 61 ( 20 ~; 14 |; 18 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 19 ( 11 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f266,plain,
$false,
inference(subsumption_resolution,[],[f209,f197]) ).
fof(f197,plain,
~ frontsegP(sK3,sK3),
inference(subsumption_resolution,[],[f185,f184]) ).
fof(f184,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f136,f133]) ).
fof(f133,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f99]) ).
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/benchmark/theBenchmark.p',co1) ).
fof(f136,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f99]) ).
fof(f185,plain,
( ~ neq(sK3,nil)
| ~ frontsegP(sK3,sK3) ),
inference(definition_unfolding,[],[f131,f180,f133,f180]) ).
fof(f180,plain,
sK0 = sK3,
inference(definition_unfolding,[],[f134,f135]) ).
fof(f135,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f99]) ).
fof(f134,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f99]) ).
fof(f131,plain,
( ~ neq(sK0,nil)
| ~ frontsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f209,plain,
frontsegP(sK3,sK3),
inference(unit_resulting_resolution,[],[f181,f159]) ).
fof(f159,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax42) ).
fof(f181,plain,
ssList(sK3),
inference(definition_unfolding,[],[f139,f180]) ).
fof(f139,plain,
ssList(sK0),
inference(cnf_transformation,[],[f99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWC102+1 : TPTP v8.2.0. Released v2.4.0.
% 0.14/0.16 % 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.37 % Computer : n015.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sun May 19 03:16:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.38 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.60/0.76 % (30181)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 (2996ds/83Mi)
% 0.60/0.77 % (30175)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 (2996ds/34Mi)
% 0.60/0.77 % (30176)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 (2996ds/51Mi)
% 0.60/0.77 % (30177)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.60/0.77 % (30178)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.60/0.77 % (30179)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 (2996ds/34Mi)
% 0.60/0.77 % (30180)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.60/0.77 % (30181)First to succeed.
% 0.60/0.77 % (30181)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30174"
% 0.60/0.77 % (30178)Also succeeded, but the first one will report.
% 0.60/0.77 % (30175)Also succeeded, but the first one will report.
% 0.60/0.77 % (30181)Refutation found. Thanks to Tanya!
% 0.60/0.77 % SZS status Theorem for theBenchmark
% 0.60/0.77 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.77 % (30181)------------------------------
% 0.60/0.77 % (30181)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.77 % (30181)Termination reason: Refutation
% 0.60/0.77
% 0.60/0.77 % (30181)Memory used [KB]: 1167
% 0.60/0.77 % (30181)Time elapsed: 0.004 s
% 0.60/0.77 % (30181)Instructions burned: 9 (million)
% 0.60/0.77 % (30174)Success in time 0.383 s
% 0.60/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------