TSTP Solution File: SWC035+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC035+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.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 03:59:20 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 9 unt; 0 def)
% Number of atoms : 52 ( 43 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 57 ( 20 ~; 12 |; 16 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f111,plain,
$false,
inference(trivial_inequality_removal,[],[f110]) ).
fof(f110,plain,
sK3 != sK3,
inference(definition_unfolding,[],[f107,f108,f109]) ).
fof(f109,plain,
sK0 = sK3,
inference(definition_unfolding,[],[f105,f106]) ).
fof(f106,plain,
sK2 = sK3,
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
( nil != sK0
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f101]) ).
fof(f101,plain,
( ? [X0,X1,X2,X3] :
( nil != X0
& X2 = X3
& X0 = X2
& X1 = X3
& nil = X1 )
=> ( nil != sK0
& sK2 = sK3
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0,X1,X2,X3] :
( nil != X0
& X2 = X3
& X0 = X2
& X1 = X3
& nil = X1 ),
inference(ennf_transformation,[],[f99]) ).
fof(f99,plain,
~ ! [X0,X1,X2,X3] :
( nil = X0
| X2 != X3
| X0 != X2
| X1 != X3
| nil != X1 ),
inference(pure_predicate_removal,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil = X0
| X2 != X3
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( nil = X0
| X2 != X3
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.3jeyzFR4hr/Vampire---4.8_16829',co1) ).
fof(f105,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f102]) ).
fof(f108,plain,
nil = sK3,
inference(definition_unfolding,[],[f103,f104]) ).
fof(f104,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f102]) ).
fof(f103,plain,
nil = sK1,
inference(cnf_transformation,[],[f102]) ).
fof(f107,plain,
nil != sK0,
inference(cnf_transformation,[],[f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC035+1 : TPTP v8.1.2. Released v2.4.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n013.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:15:49 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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.3jeyzFR4hr/Vampire---4.8_16829
% 0.56/0.76 % (17031)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.56/0.76 % (17033)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.56/0.76 % (17031)First to succeed.
% 0.56/0.76 % (17026)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.56/0.76 % (17028)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.56/0.76 % (17033)Also succeeded, but the first one will report.
% 0.56/0.76 % (17027)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.56/0.76 % (17029)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.56/0.76 % (17030)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.56/0.76 % (17032)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.56/0.76 % (17031)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for Vampire---4
% 0.56/0.76 % SZS output start Proof for Vampire---4
% See solution above
% 0.56/0.76 % (17031)------------------------------
% 0.56/0.76 % (17031)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.56/0.76 % (17031)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (17031)Memory used [KB]: 1049
% 0.56/0.76 % (17031)Time elapsed: 0.002 s
% 0.56/0.76 % (17031)Instructions burned: 2 (million)
% 0.56/0.76 % (17031)------------------------------
% 0.56/0.76 % (17031)------------------------------
% 0.56/0.76 % (16989)Success in time 0.388 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------