TSTP Solution File: SWC040+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC040+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n007.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:46 EDT 2024
% Result : Theorem 0.56s 0.76s
% Output : Refutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 10 unt; 0 def)
% Number of atoms : 215 ( 123 equ)
% Maximal formula atoms : 30 ( 8 avg)
% Number of connectives : 242 ( 52 ~; 37 |; 134 &)
% ( 1 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 63 ( 15 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f255,plain,
$false,
inference(subsumption_resolution,[],[f205,f254]) ).
fof(f254,plain,
sQ10_eqProxy(sK2,sK3),
inference(subsumption_resolution,[],[f204,f226]) ).
fof(f226,plain,
! [X0] : sQ10_eqProxy(X0,X0),
inference(equality_proxy_axiom,[],[f201]) ).
fof(f201,plain,
! [X0,X1] :
( sQ10_eqProxy(X0,X1)
<=> X0 = X1 ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ10_eqProxy])]) ).
fof(f204,plain,
( ~ sQ10_eqProxy(sK3,sK3)
| sQ10_eqProxy(sK2,sK3) ),
inference(equality_proxy_replacement,[],[f182,f201,f201]) ).
fof(f182,plain,
( sK3 != sK3
| sK2 = sK3 ),
inference(definition_unfolding,[],[f145,f177,f177]) ).
fof(f177,plain,
nil = sK3,
inference(definition_unfolding,[],[f141,f142]) ).
fof(f142,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( ( ~ neq(sK3,nil)
| ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& nil != sK0
& 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,sK4,sK5])],[f99,f125,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK3 = app(X5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X5)
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X5] :
( sK3 = app(X5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X5)
& ssList(X5) )
=> ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& nil != X0
& 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f141,plain,
nil = sK1,
inference(cnf_transformation,[],[f126]) ).
fof(f145,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f205,plain,
~ sQ10_eqProxy(sK2,sK3),
inference(equality_proxy_replacement,[],[f183,f201]) ).
fof(f183,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f144,f177,f143]) ).
fof(f143,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f126]) ).
fof(f144,plain,
nil != sK0,
inference(cnf_transformation,[],[f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWC040+1 : TPTP v8.2.0. 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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n007.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 : Sun May 19 02:53:38 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 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/benchmark/theBenchmark.p
% 0.56/0.75 % (11790)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 (2996ds/56Mi)
% 0.56/0.75 % (11783)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 (2996ds/34Mi)
% 0.56/0.75 % (11790)First to succeed.
% 0.56/0.75 % (11783)Also succeeded, but the first one will report.
% 0.56/0.75 % (11789)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 (2996ds/83Mi)
% 0.56/0.76 % (11785)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.56/0.76 % (11790)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-11782"
% 0.56/0.76 % (11784)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 (2996ds/51Mi)
% 0.56/0.76 % (11790)Refutation found. Thanks to Tanya!
% 0.56/0.76 % SZS status Theorem for theBenchmark
% 0.56/0.76 % SZS output start Proof for theBenchmark
% See solution above
% 0.56/0.76 % (11790)------------------------------
% 0.56/0.76 % (11790)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.56/0.76 % (11790)Termination reason: Refutation
% 0.56/0.76
% 0.56/0.76 % (11790)Memory used [KB]: 1159
% 0.56/0.76 % (11790)Time elapsed: 0.006 s
% 0.56/0.76 % (11790)Instructions burned: 6 (million)
% 0.56/0.76 % (11782)Success in time 0.385 s
% 0.56/0.76 % Vampire---4.8 exiting
%------------------------------------------------------------------------------