TSTP Solution File: SWC135+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC135+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 : n025.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:00:00 EDT 2024
% Result : Theorem 0.58s 0.75s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 122 ( 33 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 138 ( 41 ~; 15 |; 66 &)
% ( 2 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 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 : 40 ( 16 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f195,plain,
$false,
inference(subsumption_resolution,[],[f184,f137]) ).
fof(f137,plain,
cyclefreeP(nil),
inference(cnf_transformation,[],[f60]) ).
fof(f60,axiom,
cyclefreeP(nil),
file('/export/starexec/sandbox/tmp/tmp.kJoqYLuyUR/Vampire---4.8_4308',ax60) ).
fof(f184,plain,
~ cyclefreeP(nil),
inference(backward_demodulation,[],[f151,f178]) ).
fof(f178,plain,
nil = sK5,
inference(unit_resulting_resolution,[],[f127,f136,f130,f133]) ).
fof(f133,plain,
! [X0,X1] :
( X0 = X1
| neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kJoqYLuyUR/Vampire---4.8_4308',ax15) ).
fof(f130,plain,
~ neq(sK5,nil),
inference(cnf_transformation,[],[f112]) ).
fof(f112,plain,
( ~ cyclefreeP(sK3)
& ~ neq(sK5,nil)
& sK2 = sK4
& sK3 = sK5
& ssList(sK5)
& ssList(sK4)
& ssList(sK3)
& ssList(sK2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f99,f111,f110,f109,f108]) ).
fof(f108,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK2 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f109,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& sK2 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = X2
& sK3 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f110,plain,
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = X2
& sK3 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = sK4
& sK3 = X3
& ssList(X3) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f111,plain,
( ? [X3] :
( ~ cyclefreeP(sK3)
& ~ neq(X3,nil)
& sK2 = sK4
& sK3 = X3
& ssList(X3) )
=> ( ~ cyclefreeP(sK3)
& ~ neq(sK5,nil)
& sK2 = sK4
& sK3 = sK5
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ cyclefreeP(X1)
& ~ neq(X3,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)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( cyclefreeP(X1)
| neq(X3,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.kJoqYLuyUR/Vampire---4.8_4308',co1) ).
fof(f136,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.kJoqYLuyUR/Vampire---4.8_4308',ax17) ).
fof(f127,plain,
ssList(sK5),
inference(cnf_transformation,[],[f112]) ).
fof(f151,plain,
~ cyclefreeP(sK5),
inference(definition_unfolding,[],[f131,f128]) ).
fof(f128,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f112]) ).
fof(f131,plain,
~ cyclefreeP(sK3),
inference(cnf_transformation,[],[f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC135+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 : n025.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:35:26 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/tmp/tmp.kJoqYLuyUR/Vampire---4.8_4308
% 0.58/0.74 % (4572)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.58/0.75 % (4568)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.58/0.75 % (4567)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.58/0.75 % (4566)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.58/0.75 % (4569)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.58/0.75 % (4571)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.58/0.75 % (4570)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.58/0.75 % (4569)First to succeed.
% 0.58/0.75 % (4571)Also succeeded, but the first one will report.
% 0.58/0.75 % (4569)Refutation found. Thanks to Tanya!
% 0.58/0.75 % SZS status Theorem for Vampire---4
% 0.58/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75 % (4569)------------------------------
% 0.58/0.75 % (4569)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75 % (4569)Termination reason: Refutation
% 0.58/0.75
% 0.58/0.75 % (4569)Memory used [KB]: 1143
% 0.58/0.75 % (4569)Time elapsed: 0.005 s
% 0.58/0.75 % (4569)Instructions burned: 5 (million)
% 0.58/0.75 % (4569)------------------------------
% 0.58/0.75 % (4569)------------------------------
% 0.58/0.75 % (4562)Success in time 0.378 s
% 0.58/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------