TSTP Solution File: SWC045+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC045+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 : n008.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.82s 0.95s
% Output : Refutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 16
% Syntax : Number of formulae : 92 ( 11 unt; 0 def)
% Number of atoms : 501 ( 137 equ)
% Maximal formula atoms : 30 ( 5 avg)
% Number of connectives : 655 ( 246 ~; 229 |; 137 &)
% ( 6 <=>; 37 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 188 ( 137 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f410,plain,
$false,
inference(subsumption_resolution,[],[f409,f164]) ).
fof(f164,plain,
ssList(sK2),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
( ! [X4] :
( ( ( ~ memberP(sK2,X4)
| ( segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
& ssList(sK4(X4)) ) )
& ( ! [X6] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& 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])],[f100,f137,f136,f135,f134,f133]) ).
fof(f133,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = X2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(sK2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(sK2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = X3
& nil = sK1
& ssList(X3) )
=> ( ! [X4] :
( ( ( ~ memberP(sK2,X4)
| ? [X5] :
( segmentP(sK3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(sK3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(sK2,X4) ) )
| ~ ssItem(X4) )
& nil != sK0
& sK0 = sK2
& sK1 = sK3
& nil = sK1
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X4] :
( ? [X5] :
( segmentP(sK3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
=> ( segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
& ssList(sK4(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ( ( ~ memberP(X2,X4)
| ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) ) )
& ( ! [X6] :
( ~ segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
| ~ ssList(X6) )
| memberP(X2,X4) ) )
| ~ ssItem(X4) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( memberP(X2,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ? [X6] :
( segmentP(X3,app(app(cons(X4,nil),X6),cons(X4,nil)))
& ssList(X6) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ( ( memberP(X2,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| 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)
=> ( ? [X4] :
( ( ( memberP(X2,X4)
& ! [X5] :
( ssList(X5)
=> ~ segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil))) ) )
| ( ? [X5] :
( segmentP(X3,app(app(cons(X4,nil),X5),cons(X4,nil)))
& ssList(X5) )
& ~ memberP(X2,X4) ) )
& ssItem(X4) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f409,plain,
~ ssList(sK2),
inference(subsumption_resolution,[],[f408,f221]) ).
fof(f221,plain,
sK2 != sK3,
inference(definition_unfolding,[],[f169,f218,f168]) ).
fof(f168,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f138]) ).
fof(f218,plain,
nil = sK3,
inference(definition_unfolding,[],[f166,f167]) ).
fof(f167,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f138]) ).
fof(f166,plain,
nil = sK1,
inference(cnf_transformation,[],[f138]) ).
fof(f169,plain,
nil != sK0,
inference(cnf_transformation,[],[f138]) ).
fof(f408,plain,
( sK2 = sK3
| ~ ssList(sK2) ),
inference(resolution,[],[f407,f232]) ).
fof(f232,plain,
! [X0] :
( ssItem(sK6(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f185,f218]) ).
fof(f185,plain,
! [X0] :
( ssItem(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f143,plain,
! [X0] :
( ( cons(sK6(X0),sK5(X0)) = X0
& ssItem(sK6(X0))
& ssList(sK5(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f113,f142,f141]) ).
fof(f141,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK5(X0)) = X0
& ssItem(X2) )
& ssList(sK5(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f142,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK5(X0)) = X0
& ssItem(X2) )
=> ( cons(sK6(X0),sK5(X0)) = X0
& ssItem(sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f113,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f112]) ).
fof(f112,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f407,plain,
~ ssItem(sK6(sK2)),
inference(subsumption_resolution,[],[f406,f164]) ).
fof(f406,plain,
( ~ ssList(sK2)
| ~ ssItem(sK6(sK2)) ),
inference(subsumption_resolution,[],[f404,f221]) ).
fof(f404,plain,
( sK2 = sK3
| ~ ssList(sK2)
| ~ ssItem(sK6(sK2)) ),
inference(resolution,[],[f402,f356]) ).
fof(f356,plain,
! [X0] :
( ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f355,f165]) ).
fof(f165,plain,
ssList(sK3),
inference(cnf_transformation,[],[f138]) ).
fof(f355,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssList(sK3) ),
inference(duplicate_literal_removal,[],[f354]) ).
fof(f354,plain,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(sK3) ),
inference(resolution,[],[f353,f193]) ).
fof(f193,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax16) ).
fof(f353,plain,
! [X0] :
( ~ ssList(cons(X0,sK3))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(subsumption_resolution,[],[f352,f171]) ).
fof(f171,plain,
! [X4] :
( ~ memberP(sK2,X4)
| ssList(sK4(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f352,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ memberP(sK2,X0) ),
inference(duplicate_literal_removal,[],[f346]) ).
fof(f346,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(resolution,[],[f193,f306]) ).
fof(f306,plain,
! [X0] :
( ~ ssList(cons(X0,sK4(X0)))
| ~ ssList(cons(X0,sK3))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(subsumption_resolution,[],[f301,f171]) ).
fof(f301,plain,
! [X0] :
( ~ ssItem(X0)
| ~ ssList(sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ memberP(sK2,X0) ),
inference(trivial_inequality_removal,[],[f300]) ).
fof(f300,plain,
! [X0] :
( sK3 != sK3
| ~ ssItem(X0)
| ~ ssList(sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ memberP(sK2,X0) ),
inference(duplicate_literal_removal,[],[f299]) ).
fof(f299,plain,
! [X0] :
( sK3 != sK3
| ~ ssItem(X0)
| ~ ssList(sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(superposition,[],[f230,f294]) ).
fof(f294,plain,
! [X0] :
( sK3 = cons(X0,sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0) ),
inference(subsumption_resolution,[],[f289,f194]) ).
fof(f194,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax26) ).
fof(f289,plain,
! [X0] :
( sK3 = cons(X0,sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3))) ),
inference(trivial_inequality_removal,[],[f288]) ).
fof(f288,plain,
! [X0] :
( sK3 != sK3
| sK3 = cons(X0,sK4(X0))
| ~ ssList(cons(X0,sK3))
| ~ ssList(cons(X0,sK4(X0)))
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3))) ),
inference(superposition,[],[f226,f274]) ).
fof(f274,plain,
! [X0] :
( sK3 = app(cons(X0,sK4(X0)),cons(X0,sK3))
| ~ ssItem(X0)
| ~ memberP(sK2,X0)
| ~ ssList(app(cons(X0,sK4(X0)),cons(X0,sK3))) ),
inference(resolution,[],[f268,f237]) ).
fof(f237,plain,
! [X0] :
( ~ segmentP(sK3,X0)
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f207,f218,f218]) ).
fof(f207,plain,
! [X0] :
( nil = X0
| ~ segmentP(nil,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f156]) ).
fof(f156,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).
fof(f268,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f267,f171]) ).
fof(f267,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssList(sK4(X0)) ),
inference(duplicate_literal_removal,[],[f266]) ).
fof(f266,plain,
! [X0] :
( segmentP(sK3,app(cons(X0,sK4(X0)),cons(X0,sK3)))
| ~ memberP(sK2,X0)
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(sK4(X0)) ),
inference(superposition,[],[f219,f228]) ).
fof(f228,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,sK3),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f178,f218]) ).
fof(f178,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f219,plain,
! [X4] :
( segmentP(sK3,app(app(cons(X4,sK3),sK4(X4)),cons(X4,sK3)))
| ~ memberP(sK2,X4)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f172,f218,f218]) ).
fof(f172,plain,
! [X4] :
( ~ memberP(sK2,X4)
| segmentP(sK3,app(app(cons(X4,nil),sK4(X4)),cons(X4,nil)))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f138]) ).
fof(f226,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| sK3 = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f175,f218,f218]) ).
fof(f175,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ! [X1] :
( ( ( nil = app(X0,X1)
| nil != X0
| nil != X1 )
& ( ( nil = X0
& nil = X1 )
| nil != app(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X0
& nil = X1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(f230,plain,
! [X0,X1] :
( cons(X1,X0) != sK3
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f183,f218]) ).
fof(f183,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f111,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax21) ).
fof(f402,plain,
! [X0] :
( memberP(X0,sK6(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f401,f233]) ).
fof(f233,plain,
! [X0] :
( ssList(sK5(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f184,f218]) ).
fof(f184,plain,
! [X0] :
( ssList(sK5(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f401,plain,
! [X0] :
( memberP(X0,sK6(X0))
| ~ ssList(sK5(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f398,f232]) ).
fof(f398,plain,
! [X0] :
( memberP(X0,sK6(X0))
| ~ ssList(sK5(X0))
| ~ ssItem(sK6(X0))
| sK3 = X0
| ~ ssList(X0) ),
inference(superposition,[],[f247,f231]) ).
fof(f231,plain,
! [X0] :
( cons(sK6(X0),sK5(X0)) = X0
| sK3 = X0
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f186,f218]) ).
fof(f186,plain,
! [X0] :
( cons(sK6(X0),sK5(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f143]) ).
fof(f247,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f241]) ).
fof(f241,plain,
! [X2,X1] :
( memberP(cons(X1,X2),X1)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X1) ),
inference(equality_resolution,[],[f198]) ).
fof(f198,plain,
! [X2,X0,X1] :
( memberP(cons(X1,X2),X0)
| X0 != X1
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax37) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC045+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14 % 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.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 03:24:08 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.13/0.35 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.77/0.91 % (5469)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.77/0.91 % (5467)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 (2994ds/34Mi)
% 0.77/0.91 % (5470)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.77/0.91 % (5471)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 (2994ds/34Mi)
% 0.77/0.91 % (5472)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.77/0.91 % (5474)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 (2994ds/56Mi)
% 0.77/0.92 % (5473)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 (2994ds/83Mi)
% 0.77/0.92 % (5468)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 (2994ds/51Mi)
% 0.77/0.93 % (5470)Instruction limit reached!
% 0.77/0.93 % (5470)------------------------------
% 0.77/0.93 % (5470)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.93 % (5471)Instruction limit reached!
% 0.77/0.93 % (5471)------------------------------
% 0.77/0.93 % (5471)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.93 % (5471)Termination reason: Unknown
% 0.77/0.93 % (5471)Termination phase: Saturation
% 0.77/0.93
% 0.77/0.93 % (5471)Memory used [KB]: 1873
% 0.77/0.93 % (5471)Time elapsed: 0.019 s
% 0.77/0.93 % (5471)Instructions burned: 36 (million)
% 0.77/0.93 % (5471)------------------------------
% 0.77/0.93 % (5471)------------------------------
% 0.77/0.93 % (5470)Termination reason: Unknown
% 0.77/0.93 % (5470)Termination phase: Saturation
% 0.77/0.93
% 0.77/0.93 % (5470)Memory used [KB]: 1692
% 0.77/0.93 % (5470)Time elapsed: 0.019 s
% 0.77/0.93 % (5470)Instructions burned: 34 (million)
% 0.77/0.93 % (5470)------------------------------
% 0.77/0.93 % (5470)------------------------------
% 0.77/0.93 % (5467)Instruction limit reached!
% 0.77/0.93 % (5467)------------------------------
% 0.77/0.93 % (5467)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.77/0.93 % (5467)Termination reason: Unknown
% 0.77/0.93 % (5467)Termination phase: Saturation
% 0.77/0.93
% 0.77/0.93 % (5467)Memory used [KB]: 1507
% 0.77/0.93 % (5467)Time elapsed: 0.021 s
% 0.77/0.93 % (5467)Instructions burned: 34 (million)
% 0.77/0.93 % (5467)------------------------------
% 0.77/0.93 % (5467)------------------------------
% 0.82/0.94 % (5475)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2994ds/55Mi)
% 0.82/0.94 % (5476)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on theBenchmark for (2994ds/50Mi)
% 0.82/0.94 % (5477)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on theBenchmark for (2994ds/208Mi)
% 0.82/0.94 % (5472)Instruction limit reached!
% 0.82/0.94 % (5472)------------------------------
% 0.82/0.94 % (5472)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.82/0.94 % (5472)Termination reason: Unknown
% 0.82/0.94 % (5472)Termination phase: Saturation
% 0.82/0.94
% 0.82/0.94 % (5472)Memory used [KB]: 1446
% 0.82/0.94 % (5472)Time elapsed: 0.026 s
% 0.82/0.94 % (5472)Instructions burned: 45 (million)
% 0.82/0.94 % (5472)------------------------------
% 0.82/0.94 % (5472)------------------------------
% 0.82/0.94 % (5474)Instruction limit reached!
% 0.82/0.94 % (5474)------------------------------
% 0.82/0.94 % (5474)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.82/0.94 % (5474)Termination reason: Unknown
% 0.82/0.94 % (5474)Termination phase: Saturation
% 0.82/0.94
% 0.82/0.94 % (5474)Memory used [KB]: 1632
% 0.82/0.94 % (5474)Time elapsed: 0.028 s
% 0.82/0.94 % (5474)Instructions burned: 57 (million)
% 0.82/0.94 % (5474)------------------------------
% 0.82/0.94 % (5474)------------------------------
% 0.82/0.94 % (5478)lrs-1011_1:1_sil=4000:plsq=on:plsqr=32,1:sp=frequency:plsql=on:nwc=10.0:i=52:aac=none:afr=on:ss=axioms:er=filter:sgt=16:rawr=on:etr=on:lma=on_0 on theBenchmark for (2994ds/52Mi)
% 0.82/0.94 % (5477)First to succeed.
% 0.82/0.94 % (5468)Instruction limit reached!
% 0.82/0.94 % (5468)------------------------------
% 0.82/0.94 % (5468)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.82/0.94 % (5468)Termination reason: Unknown
% 0.82/0.94 % (5468)Termination phase: Saturation
% 0.82/0.94
% 0.82/0.94 % (5468)Memory used [KB]: 1973
% 0.82/0.94 % (5468)Time elapsed: 0.030 s
% 0.82/0.94 % (5468)Instructions burned: 51 (million)
% 0.82/0.94 % (5468)------------------------------
% 0.82/0.94 % (5468)------------------------------
% 0.82/0.94 % (5479)lrs-1010_1:1_to=lpo:sil=2000:sp=reverse_arity:sos=on:urr=ec_only:i=518:sd=2:bd=off:ss=axioms:sgt=16_0 on theBenchmark for (2994ds/518Mi)
% 0.82/0.94 % (5477)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-5438"
% 0.82/0.95 % (5477)Refutation found. Thanks to Tanya!
% 0.82/0.95 % SZS status Theorem for theBenchmark
% 0.82/0.95 % SZS output start Proof for theBenchmark
% See solution above
% 0.82/0.95 % (5477)------------------------------
% 0.82/0.95 % (5477)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.82/0.95 % (5477)Termination reason: Refutation
% 0.82/0.95
% 0.82/0.95 % (5477)Memory used [KB]: 1178
% 0.82/0.95 % (5477)Time elapsed: 0.009 s
% 0.82/0.95 % (5477)Instructions burned: 15 (million)
% 0.82/0.95 % (5438)Success in time 0.575 s
% 0.82/0.95 % Vampire---4.8 exiting
%------------------------------------------------------------------------------