TSTP Solution File: SWC360+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC360+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 : n012.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:26 EDT 2024
% Result : Theorem 0.53s 0.74s
% Output : Refutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 6 unt; 0 def)
% Number of atoms : 189 ( 28 equ)
% Maximal formula atoms : 30 ( 12 avg)
% Number of connectives : 253 ( 79 ~; 56 |; 106 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 45 ( 19 !; 26 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f194,plain,
$false,
inference(subsumption_resolution,[],[f146,f181]) ).
fof(f181,plain,
~ segmentP(sK3,sK2),
inference(definition_unfolding,[],[f149,f143,f144]) ).
fof(f144,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f120]) ).
fof(f120,plain,
( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ segmentP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& segmentP(sK3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f119,f118,f117,f116]) ).
fof(f116,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f117,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f118,plain,
( ? [X2] :
( ? [X3] :
( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ segmentP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& segmentP(X3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f119,plain,
( ? [X3] :
( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ segmentP(X3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& segmentP(X3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,sK2)
| ~ segmentP(sK3,X4)
| ~ neq(sK2,X4)
| ~ ssList(X4) )
& totalorderedP(sK2)
& segmentP(sK3,sK2)
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ segmentP(X1,X0)
& ! [X4] :
( ~ totalorderedP(X4)
| ~ segmentP(X4,X2)
| ~ segmentP(X3,X4)
| ~ neq(X2,X4)
| ~ ssList(X4) )
& totalorderedP(X2)
& segmentP(X3,X2)
& neq(X1,nil)
& 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)
=> ( segmentP(X1,X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X1,X0)
| ? [X4] :
( totalorderedP(X4)
& segmentP(X4,X2)
& segmentP(X3,X4)
& neq(X2,X4)
& ssList(X4) )
| ~ totalorderedP(X2)
| ~ segmentP(X3,X2)
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f143,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f120]) ).
fof(f149,plain,
~ segmentP(sK1,sK0),
inference(cnf_transformation,[],[f120]) ).
fof(f146,plain,
segmentP(sK3,sK2),
inference(cnf_transformation,[],[f120]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC360+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.13 % 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.13/0.35 % Computer : n012.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:38:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/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/benchmark/theBenchmark.p
% 0.53/0.74 % (28288)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.53/0.74 % (28293)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.53/0.74 % (28292)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.53/0.74 % (28290)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.53/0.74 % (28294)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.53/0.74 % (28289)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.53/0.74 % (28291)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.53/0.74 % (28295)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.53/0.74 % (28288)Also succeeded, but the first one will report.
% 0.53/0.74 % (28291)First to succeed.
% 0.53/0.74 % (28293)Also succeeded, but the first one will report.
% 0.53/0.74 % (28291)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28287"
% 0.53/0.74 % (28295)Also succeeded, but the first one will report.
% 0.53/0.74 % (28290)Also succeeded, but the first one will report.
% 0.53/0.74 % (28291)Refutation found. Thanks to Tanya!
% 0.53/0.74 % SZS status Theorem for theBenchmark
% 0.53/0.74 % SZS output start Proof for theBenchmark
% See solution above
% 0.53/0.74 % (28291)------------------------------
% 0.53/0.74 % (28291)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.53/0.74 % (28291)Termination reason: Refutation
% 0.53/0.74
% 0.53/0.74 % (28291)Memory used [KB]: 1139
% 0.53/0.74 % (28291)Time elapsed: 0.004 s
% 0.53/0.74 % (28291)Instructions burned: 5 (million)
% 0.53/0.74 % (28287)Success in time 0.388 s
% 0.53/0.74 % Vampire---4.8 exiting
%------------------------------------------------------------------------------