TSTP Solution File: SWC044+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC044+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 : n014.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:48 EDT 2024
% Result : Theorem 0.62s 0.78s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 13 unt; 0 def)
% Number of atoms : 162 ( 63 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 180 ( 53 ~; 33 |; 77 &)
% ( 1 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 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 : 48 ( 24 !; 24 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f216,plain,
$false,
inference(subsumption_resolution,[],[f213,f135]) ).
fof(f135,plain,
ssList(sK2),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( nil != sK0
& rearsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f101,f124,f123,f122,f121]) ).
fof(f121,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != sK0
& rearsegP(X3,X2)
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != sK0
& rearsegP(X3,X2)
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( nil != sK0
& rearsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X2] :
( ? [X3] :
( nil != sK0
& rearsegP(X3,X2)
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( nil != sK0
& rearsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X3] :
( nil != sK0
& rearsegP(X3,sK2)
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
=> ( nil != sK0
& rearsegP(sK3,sK2)
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f101,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f100]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( nil != X0
& rearsegP(X3,X2)
& X0 = X2
& X1 = X3
& nil = X1
& 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)
=> ( nil = X0
| ~ rearsegP(X3,X2)
| 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
| ~ rearsegP(X3,X2)
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f213,plain,
~ ssList(sK2),
inference(resolution,[],[f169,f207]) ).
fof(f207,plain,
~ rearsegP(sK2,sK3),
inference(subsumption_resolution,[],[f206,f135]) ).
fof(f206,plain,
( ~ rearsegP(sK2,sK3)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f205,f136]) ).
fof(f136,plain,
ssList(sK3),
inference(cnf_transformation,[],[f125]) ).
fof(f205,plain,
( ~ rearsegP(sK2,sK3)
| ~ ssList(sK3)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f200,f140]) ).
fof(f140,plain,
rearsegP(sK3,sK2),
inference(cnf_transformation,[],[f125]) ).
fof(f200,plain,
( ~ rearsegP(sK3,sK2)
| ~ rearsegP(sK2,sK3)
| ~ ssList(sK3)
| ~ ssList(sK2) ),
inference(resolution,[],[f180,f182]) ).
fof(f182,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
| ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(equality_proxy_replacement,[],[f148,f179]) ).
fof(f179,plain,
! [X0,X1] :
( sQ5_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ5_eqProxy])]) ).
fof(f148,plain,
! [X0,X1] :
( X0 = X1
| ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f107]) ).
fof(f107,plain,
! [X0] :
( ! [X1] :
( X0 = X1
| ~ rearsegP(X1,X0)
| ~ rearsegP(X0,X1)
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( ( rearsegP(X1,X0)
& rearsegP(X0,X1) )
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax48) ).
fof(f180,plain,
~ sQ5_eqProxy(sK2,sK3),
inference(equality_proxy_replacement,[],[f163,f179]) ).
fof(f163,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f141,f162,f139]) ).
fof(f139,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f162,plain,
nil = sK3,
inference(definition_unfolding,[],[f137,f138]) ).
fof(f138,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
fof(f137,plain,
nil = sK1,
inference(cnf_transformation,[],[f125]) ).
fof(f141,plain,
nil != sK0,
inference(cnf_transformation,[],[f125]) ).
fof(f169,plain,
! [X0] :
( rearsegP(X0,sK3)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f145,f162]) ).
fof(f145,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
fof(f103,plain,
! [X0] :
( rearsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax51) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : SWC044+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/0.11 % 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.31 % Computer : n014.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Sun May 19 03:04: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.62/0.78 % (29905)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.62/0.78 % (29910)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.62/0.78 % (29912)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.62/0.78 % (29911)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.62/0.78 % (29909)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.62/0.78 % (29906)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.62/0.78 % (29912)First to succeed.
% 0.62/0.78 % (29910)Also succeeded, but the first one will report.
% 0.62/0.78 % (29912)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-29904"
% 0.62/0.78 % (29912)Refutation found. Thanks to Tanya!
% 0.62/0.78 % SZS status Theorem for theBenchmark
% 0.62/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.62/0.78 % (29912)------------------------------
% 0.62/0.78 % (29912)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.62/0.78 % (29912)Termination reason: Refutation
% 0.62/0.78
% 0.62/0.78 % (29912)Memory used [KB]: 1157
% 0.62/0.78 % (29912)Time elapsed: 0.004 s
% 0.62/0.78 % (29912)Instructions burned: 5 (million)
% 0.62/0.78 % (29904)Success in time 0.459 s
% 0.62/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------