TSTP Solution File: SWC328+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC328+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 : n011.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:11 EDT 2024
% Result : Theorem 0.59s 0.75s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 10 unt; 0 def)
% Number of atoms : 139 ( 42 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 148 ( 40 ~; 26 |; 67 &)
% ( 2 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 36 ( 12 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f283,plain,
$false,
inference(avatar_sat_refutation,[],[f267,f268,f282]) ).
fof(f282,plain,
spl15_1,
inference(avatar_contradiction_clause,[],[f281]) ).
fof(f281,plain,
( $false
| spl15_1 ),
inference(subsumption_resolution,[],[f276,f160]) ).
fof(f160,plain,
ssList(sK3),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = sK2
& sK1 = sK3
& nil = sK2
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f134,f133,f132,f131]) ).
fof(f131,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(X1,sK0) )
& sK0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(X1,sK0) )
& sK0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = X2
& sK1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = X2
& sK1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = sK2
& sK1 = X3
& nil = sK2
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X3] :
( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = sK2
& sK1 = X3
& nil = sK2
& ssList(X3) )
=> ( ( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) )
& sK0 = sK2
& sK1 = sK3
& nil = sK2
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2
& 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) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f276,plain,
( ~ ssList(sK3)
| spl15_1 ),
inference(resolution,[],[f214,f262]) ).
fof(f262,plain,
( ~ segmentP(sK3,sK2)
| spl15_1 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f260,plain,
( spl15_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_1])]) ).
fof(f214,plain,
! [X0] :
( segmentP(X0,sK2)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f168,f161]) ).
fof(f161,plain,
nil = sK2,
inference(cnf_transformation,[],[f135]) ).
fof(f168,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax57) ).
fof(f268,plain,
spl15_2,
inference(avatar_split_clause,[],[f215,f264]) ).
fof(f264,plain,
( spl15_2
<=> equalelemsP(sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl15_2])]) ).
fof(f215,plain,
equalelemsP(sK2),
inference(definition_unfolding,[],[f177,f161]) ).
fof(f177,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax74) ).
fof(f267,plain,
( ~ spl15_1
| ~ spl15_2 ),
inference(avatar_split_clause,[],[f208,f264,f260]) ).
fof(f208,plain,
( ~ equalelemsP(sK2)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f164,f163,f162,f163]) ).
fof(f162,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f135]) ).
fof(f163,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f135]) ).
fof(f164,plain,
( ~ equalelemsP(sK0)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC328+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/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 : n011.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 : Sun May 19 03:16:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.59/0.75 % (16534)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 (2996ds/56Mi)
% 0.59/0.75 % (16526)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.59/0.75 % (16529)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.59/0.75 % (16527)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.59/0.75 % (16531)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.59/0.75 % (16532)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.59/0.75 % (16530)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.59/0.75 % (16533)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.59/0.75 % (16534)First to succeed.
% 0.59/0.75 % (16534)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-16386"
% 0.59/0.75 % (16534)Refutation found. Thanks to Tanya!
% 0.59/0.75 % SZS status Theorem for theBenchmark
% 0.59/0.75 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.75 % (16534)------------------------------
% 0.59/0.75 % (16534)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.75 % (16534)Termination reason: Refutation
% 0.59/0.75
% 0.59/0.75 % (16534)Memory used [KB]: 1167
% 0.59/0.75 % (16534)Time elapsed: 0.003 s
% 0.59/0.75 % (16534)Instructions burned: 6 (million)
% 0.59/0.75 % (16386)Success in time 0.387 s
% 0.59/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------