TSTP Solution File: SWC036+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC036+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 : n024.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 : Sun May 5 09:48:08 EDT 2024
% Result : Theorem 0.57s 0.75s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 68 ( 53 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 76 ( 28 ~; 19 |; 19 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 23 ( 15 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f116,plain,
$false,
inference(subsumption_resolution,[],[f113,f115]) ).
fof(f115,plain,
sQ4_eqProxy(sK2,sK3),
inference(subsumption_resolution,[],[f112,f114]) ).
fof(f114,plain,
! [X0] : sQ4_eqProxy(X0,X0),
inference(equality_proxy_axiom,[],[f111]) ).
fof(f111,plain,
! [X0,X1] :
( sQ4_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ4_eqProxy])]) ).
fof(f112,plain,
( ~ sQ4_eqProxy(sK3,sK3)
| sQ4_eqProxy(sK2,sK3) ),
inference(equality_proxy_replacement,[],[f109,f111,f111]) ).
fof(f109,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(definition_unfolding,[],[f107,f108,f108]) ).
fof(f108,plain,
nil = sK3,
inference(definition_unfolding,[],[f103,f104]) ).
fof(f104,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
( ( nil != sK3
| nil = sK2 )
& nil != sK0
& 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 != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 )
=> ( ( nil != sK3
| nil = sK2 )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1 ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0,X1,X2,X3] :
( ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ),
inference(ennf_transformation,[],[f99]) ).
fof(f99,plain,
~ ! [X0,X1,X2,X3] :
( ( nil = X3
& nil != X2 )
| nil = X0
| 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 = X3
& nil != X2 )
| nil = X0
| 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 = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.72fsctQxc2/Vampire---4.8_5564',co1) ).
fof(f103,plain,
nil = sK1,
inference(cnf_transformation,[],[f102]) ).
fof(f107,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f102]) ).
fof(f113,plain,
~ sQ4_eqProxy(sK2,sK3),
inference(equality_proxy_replacement,[],[f110,f111]) ).
fof(f110,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f106,f108,f105]) ).
fof(f105,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f102]) ).
fof(f106,plain,
nil != sK0,
inference(cnf_transformation,[],[f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SWC036+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/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.16/0.36 % Computer : n024.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 20:31:08 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.72fsctQxc2/Vampire---4.8_5564
% 0.57/0.75 % (5947)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.57/0.75 % (5947)First to succeed.
% 0.57/0.75 % (5940)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.57/0.75 % (5941)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.57/0.75 % (5942)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.57/0.75 % (5943)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.57/0.75 % (5944)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.57/0.75 % (5946)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.57/0.75 % (5947)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-5811"
% 0.57/0.75 % (5945)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.57/0.75 % (5947)Refutation found. Thanks to Tanya!
% 0.57/0.75 % SZS status Theorem for Vampire---4
% 0.57/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.57/0.75 % (5947)------------------------------
% 0.57/0.75 % (5947)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.57/0.75 % (5947)Termination reason: Refutation
% 0.57/0.75
% 0.57/0.75 % (5947)Memory used [KB]: 1051
% 0.57/0.75 % (5947)Time elapsed: 0.002 s
% 0.57/0.75 % (5947)Instructions burned: 3 (million)
% 0.57/0.75 % (5811)Success in time 0.38 s
% 0.57/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------