TSTP Solution File: SWC026+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC026+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n019.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:35:39 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 105 ( 86 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 130 ( 46 ~; 40 |; 33 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 20 ( 12 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f127,plain,
$false,
inference(avatar_sat_refutation,[],[f123,f124,f125,f126]) ).
fof(f126,plain,
( spl4_2
| ~ spl4_1 ),
inference(avatar_split_clause,[],[f105,f116,f120]) ).
fof(f120,plain,
( spl4_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f116,plain,
( spl4_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f105,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f102]) ).
fof(f102,plain,
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK3
| nil = sK2 )
& ( nil != sK2
| nil = sK3 )
& sK0 = sK2
& sK1 = sK3 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f101]) ).
fof(f101,plain,
( ? [X0,X1,X2,X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& X0 = X2
& X1 = X3 )
=> ( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK3
| nil = sK2 )
& ( nil != sK2
| nil = sK3 )
& sK0 = sK2
& sK1 = sK3 ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0,X1,X2,X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( nil != X3
| nil = X2 )
& ( nil != X2
| nil = X3 )
& X0 = X2
& X1 = X3 ),
inference(ennf_transformation,[],[f99]) ).
fof(f99,plain,
~ ! [X0,X1,X2,X3] :
( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| X0 != X2
| X1 != X3 ),
inference(pure_predicate_removal,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( nil = X3
& nil != X2 )
| ( nil = X2
& nil != X3 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f125,plain,
( spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f106,f120,f116]) ).
fof(f106,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f102]) ).
fof(f124,plain,
( spl4_2
| spl4_1 ),
inference(avatar_split_clause,[],[f114,f116,f120]) ).
fof(f114,plain,
( nil = sK2
| nil = sK3 ),
inference(definition_unfolding,[],[f107,f104,f103]) ).
fof(f103,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f102]) ).
fof(f104,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f102]) ).
fof(f107,plain,
( nil = sK0
| nil = sK1 ),
inference(cnf_transformation,[],[f102]) ).
fof(f123,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f111,f120,f116]) ).
fof(f111,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f110,f103,f104]) ).
fof(f110,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f102]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC026+1 : TPTP v8.2.0. Released v2.4.0.
% 0.10/0.12 % 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.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Sun May 19 02:48:08 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a FOF_THM_RFO_SEQ problem
% 0.11/0.32 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/benchmark/theBenchmark.p
% 0.60/0.81 % (704)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 (2995ds/34Mi)
% 0.60/0.81 % (706)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.81 % (707)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.81 % (705)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 (2995ds/51Mi)
% 0.60/0.81 % (708)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 (2995ds/34Mi)
% 0.60/0.81 % (709)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.81 % (710)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 (2995ds/83Mi)
% 0.60/0.81 % (711)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 (2995ds/56Mi)
% 0.60/0.81 % (706)Also succeeded, but the first one will report.
% 0.60/0.81 % (709)Also succeeded, but the first one will report.
% 0.60/0.81 % (707)First to succeed.
% 0.60/0.81 % (707)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-703"
% 0.60/0.81 % (711)Also succeeded, but the first one will report.
% 0.60/0.81 % (704)Also succeeded, but the first one will report.
% 0.60/0.81 % (710)Also succeeded, but the first one will report.
% 0.60/0.81 % (707)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for theBenchmark
% 0.60/0.81 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.81 % (707)------------------------------
% 0.60/0.81 % (707)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.81 % (707)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (707)Memory used [KB]: 1062
% 0.60/0.81 % (707)Time elapsed: 0.003 s
% 0.60/0.81 % (707)Instructions burned: 3 (million)
% 0.60/0.81 % (703)Success in time 0.481 s
% 0.60/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------