TSTP Solution File: SWC063+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC063+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 : n003.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:56 EDT 2024
% Result : Theorem 0.59s 0.73s
% Output : Refutation 0.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 29
% Syntax : Number of formulae : 137 ( 7 unt; 0 def)
% Number of atoms : 726 ( 172 equ)
% Maximal formula atoms : 40 ( 5 avg)
% Number of connectives : 985 ( 396 ~; 375 |; 166 &)
% ( 15 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 12 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 165 ( 108 !; 57 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f940,plain,
$false,
inference(avatar_sat_refutation,[],[f228,f233,f238,f239,f244,f249,f254,f259,f260,f343,f734,f787,f929]) ).
fof(f929,plain,
( ~ spl12_2
| ~ spl12_4
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14
| ~ spl12_18 ),
inference(avatar_contradiction_clause,[],[f928]) ).
fof(f928,plain,
( $false
| ~ spl12_2
| ~ spl12_4
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14
| ~ spl12_18 ),
inference(subsumption_resolution,[],[f892,f843]) ).
fof(f843,plain,
( segmentP(sK2,sK2)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14
| ~ spl12_18 ),
inference(backward_demodulation,[],[f606,f791]) ).
fof(f791,plain,
( sK2 = cons(sK4,nil)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14 ),
inference(backward_demodulation,[],[f313,f387]) ).
fof(f387,plain,
( nil = sK5
| ~ spl12_14 ),
inference(avatar_component_clause,[],[f385]) ).
fof(f385,plain,
( spl12_14
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_14])]) ).
fof(f313,plain,
( sK2 = cons(sK4,sK5)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8 ),
inference(subsumption_resolution,[],[f305,f253]) ).
fof(f253,plain,
( ssList(sK5)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f251]) ).
fof(f251,plain,
( spl12_7
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f305,plain,
( sK2 = cons(sK4,sK5)
| ~ ssList(sK5)
| ~ spl12_6
| ~ spl12_8 ),
inference(superposition,[],[f301,f248]) ).
fof(f248,plain,
( sK2 = app(cons(sK4,nil),sK5)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f246,plain,
( spl12_6
<=> sK2 = app(cons(sK4,nil),sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f301,plain,
( ! [X0] :
( cons(sK4,X0) = app(cons(sK4,nil),X0)
| ~ ssList(X0) )
| ~ spl12_8 ),
inference(resolution,[],[f184,f258]) ).
fof(f258,plain,
( ssItem(sK4)
| ~ spl12_8 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl12_8
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_8])]) ).
fof(f184,plain,
! [X0,X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,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(f606,plain,
( segmentP(sK2,cons(sK4,nil))
| ~ spl12_18 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f605,plain,
( spl12_18
<=> segmentP(sK2,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_18])]) ).
fof(f892,plain,
( ~ segmentP(sK2,sK2)
| ~ spl12_2
| ~ spl12_4
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14 ),
inference(backward_demodulation,[],[f266,f888]) ).
fof(f888,plain,
( sK2 = sK3
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14 ),
inference(subsumption_resolution,[],[f871,f155]) ).
fof(f155,plain,
ssList(sK2),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f99,f135,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = sK2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = sK2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = sK3
& app(cons(X5,nil),X6) = sK2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = sK3
& app(cons(X5,nil),X6) = sK2
& ssList(X6) )
& ssItem(X5) )
=> ( ? [X6] :
( sK3 = app(X6,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X6)
& ssList(X6) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f135,plain,
( ? [X6] :
( sK3 = app(X6,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X6)
& ssList(X6) )
=> ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X5] :
( ? [X6] :
( app(X6,cons(X5,nil)) = X3
& app(cons(X5,nil),X6) = X2
& ssList(X6) )
& ssItem(X5) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& 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] :
( ( ( ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X5] :
( ssItem(X5)
=> ! [X6] :
( app(X6,cons(X5,nil)) != X3
| app(cons(X5,nil),X6) != X2
| ~ ssList(X6) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( segmentP(X0,X6)
& segmentP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( segmentP(X0,X6)
& segmentP(X1,X6)
& neq(X6,nil)
& ssList(X6) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f871,plain,
( sK2 = sK3
| ~ ssList(sK2)
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14 ),
inference(superposition,[],[f187,f858]) ).
fof(f858,plain,
( sK3 = app(nil,sK2)
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_8
| ~ spl12_14 ),
inference(backward_demodulation,[],[f788,f791]) ).
fof(f788,plain,
( sK3 = app(nil,cons(sK4,nil))
| ~ spl12_5
| ~ spl12_14 ),
inference(backward_demodulation,[],[f243,f387]) ).
fof(f243,plain,
( sK3 = app(sK5,cons(sK4,nil))
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl12_5
<=> sK3 = app(sK5,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f187,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax28) ).
fof(f266,plain,
( ~ segmentP(sK2,sK3)
| ~ spl12_2
| ~ spl12_4 ),
inference(subsumption_resolution,[],[f265,f237]) ).
fof(f237,plain,
( neq(sK3,nil)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl12_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f265,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK2,sK3)
| ~ spl12_2 ),
inference(subsumption_resolution,[],[f264,f156]) ).
fof(f156,plain,
ssList(sK3),
inference(cnf_transformation,[],[f136]) ).
fof(f264,plain,
( ~ ssList(sK3)
| ~ neq(sK3,nil)
| ~ segmentP(sK2,sK3)
| ~ spl12_2 ),
inference(duplicate_literal_removal,[],[f263]) ).
fof(f263,plain,
( ~ ssList(sK3)
| ~ ssList(sK3)
| ~ neq(sK3,nil)
| ~ segmentP(sK2,sK3)
| ~ spl12_2 ),
inference(resolution,[],[f199,f227]) ).
fof(f227,plain,
( ! [X4] :
( ~ segmentP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK2,X4) )
| ~ spl12_2 ),
inference(avatar_component_clause,[],[f226]) ).
fof(f226,plain,
( spl12_2
<=> ! [X4] :
( ~ segmentP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_2])]) ).
fof(f199,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax55) ).
fof(f787,plain,
( spl12_14
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(avatar_split_clause,[],[f786,f315,f251,f246,f241,f226,f385]) ).
fof(f315,plain,
( spl12_9
<=> ssList(cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_9])]) ).
fof(f786,plain,
( nil = sK5
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f785,f253]) ).
fof(f785,plain,
( nil = sK5
| ~ ssList(sK5)
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f775,f194]) ).
fof(f194,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f775,plain,
( nil = sK5
| ~ ssList(nil)
| ~ ssList(sK5)
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(resolution,[],[f741,f191]) ).
fof(f191,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f741,plain,
( ~ neq(sK5,nil)
| ~ spl12_2
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f740,f553]) ).
fof(f553,plain,
( segmentP(sK2,sK5)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f552,f194]) ).
fof(f552,plain,
( ~ ssList(nil)
| segmentP(sK2,sK5)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f549,f155]) ).
fof(f549,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK5)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(duplicate_literal_removal,[],[f548]) ).
fof(f548,plain,
( ~ ssList(sK2)
| ~ ssList(nil)
| segmentP(sK2,sK5)
| ~ ssList(sK2)
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(superposition,[],[f539,f179]) ).
fof(f179,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f539,plain,
( ! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| segmentP(app(sK2,X0),sK5) )
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f538,f253]) ).
fof(f538,plain,
( ! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(sK5)
| segmentP(app(sK2,X0),sK5) )
| ~ spl12_6
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f528,f316]) ).
fof(f316,plain,
( ssList(cons(sK4,nil))
| ~ spl12_9 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f528,plain,
( ! [X0] :
( ~ ssList(app(sK2,X0))
| ~ ssList(X0)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| segmentP(app(sK2,X0),sK5) )
| ~ spl12_6 ),
inference(superposition,[],[f217,f248]) ).
fof(f217,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f205]) ).
fof(f205,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1))
& ssList(sK10(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11])],[f149,f151,f150]) ).
fof(f150,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f151,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK10(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax7) ).
fof(f740,plain,
( ~ neq(sK5,nil)
| ~ segmentP(sK2,sK5)
| ~ spl12_2
| ~ spl12_5
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f735,f253]) ).
fof(f735,plain,
( ~ ssList(sK5)
| ~ neq(sK5,nil)
| ~ segmentP(sK2,sK5)
| ~ spl12_2
| ~ spl12_5
| ~ spl12_7
| ~ spl12_9 ),
inference(resolution,[],[f731,f227]) ).
fof(f731,plain,
( segmentP(sK3,sK5)
| ~ spl12_5
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f730,f316]) ).
fof(f730,plain,
( segmentP(sK3,sK5)
| ~ ssList(cons(sK4,nil))
| ~ spl12_5
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f713,f253]) ).
fof(f713,plain,
( segmentP(sK3,sK5)
| ~ ssList(sK5)
| ~ ssList(cons(sK4,nil))
| ~ spl12_5 ),
inference(superposition,[],[f542,f243]) ).
fof(f542,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f541,f189]) ).
fof(f189,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,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(f541,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f534,f194]) ).
fof(f534,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f530]) ).
fof(f530,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f217,f187]) ).
fof(f734,plain,
( spl12_18
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(avatar_split_clause,[],[f733,f315,f251,f246,f605]) ).
fof(f733,plain,
( segmentP(sK2,cons(sK4,nil))
| ~ spl12_6
| ~ spl12_7
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f732,f253]) ).
fof(f732,plain,
( segmentP(sK2,cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl12_6
| ~ spl12_9 ),
inference(subsumption_resolution,[],[f710,f316]) ).
fof(f710,plain,
( segmentP(sK2,cons(sK4,nil))
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl12_6 ),
inference(superposition,[],[f542,f248]) ).
fof(f343,plain,
( ~ spl12_8
| spl12_9 ),
inference(avatar_contradiction_clause,[],[f342]) ).
fof(f342,plain,
( $false
| ~ spl12_8
| spl12_9 ),
inference(subsumption_resolution,[],[f341,f194]) ).
fof(f341,plain,
( ~ ssList(nil)
| ~ spl12_8
| spl12_9 ),
inference(subsumption_resolution,[],[f340,f258]) ).
fof(f340,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| spl12_9 ),
inference(resolution,[],[f317,f178]) ).
fof(f178,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f106]) ).
fof(f106,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(f317,plain,
( ~ ssList(cons(sK4,nil))
| spl12_9 ),
inference(avatar_component_clause,[],[f315]) ).
fof(f260,plain,
( spl12_1
| ~ spl12_3 ),
inference(avatar_split_clause,[],[f159,f230,f222]) ).
fof(f222,plain,
( spl12_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f230,plain,
( spl12_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_3])]) ).
fof(f159,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f136]) ).
fof(f259,plain,
( spl12_8
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f160,f235,f256]) ).
fof(f160,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f136]) ).
fof(f254,plain,
( spl12_7
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f161,f235,f251]) ).
fof(f161,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f136]) ).
fof(f249,plain,
( spl12_6
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f162,f235,f246]) ).
fof(f162,plain,
( ~ neq(sK3,nil)
| sK2 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f136]) ).
fof(f244,plain,
( spl12_5
| ~ spl12_4 ),
inference(avatar_split_clause,[],[f163,f235,f241]) ).
fof(f163,plain,
( ~ neq(sK3,nil)
| sK3 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f136]) ).
fof(f239,plain,
( spl12_3
| spl12_4 ),
inference(avatar_split_clause,[],[f209,f235,f230]) ).
fof(f209,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f164,f157,f157]) ).
fof(f157,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f136]) ).
fof(f164,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f136]) ).
fof(f238,plain,
( ~ spl12_1
| spl12_4 ),
inference(avatar_split_clause,[],[f208,f235,f222]) ).
fof(f208,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f165,f157,f158]) ).
fof(f158,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f136]) ).
fof(f165,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f136]) ).
fof(f233,plain,
( spl12_3
| spl12_2 ),
inference(avatar_split_clause,[],[f207,f226,f230]) ).
fof(f207,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f166,f158,f157,f157]) ).
fof(f166,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f136]) ).
fof(f228,plain,
( ~ spl12_1
| spl12_2 ),
inference(avatar_split_clause,[],[f206,f226,f222]) ).
fof(f206,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK2 ),
inference(definition_unfolding,[],[f167,f158,f157,f158]) ).
fof(f167,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil != sK0 ),
inference(cnf_transformation,[],[f136]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC063+1 : TPTP v8.2.0. Released v2.4.0.
% 0.03/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.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun May 19 03:15:38 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.12/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.12/0.33 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.50/0.70 % (16359)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.50/0.70 % (16363)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.50/0.70 % (16361)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.50/0.70 % (16364)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.50/0.70 % (16365)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.50/0.71 % (16358)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.50/0.71 % (16362)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 (2996ds/34Mi)
% 0.50/0.71 % (16361)Instruction limit reached!
% 0.50/0.71 % (16361)------------------------------
% 0.50/0.71 % (16361)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.71 % (16361)Termination reason: Unknown
% 0.50/0.71 % (16361)Termination phase: Saturation
% 0.50/0.71
% 0.50/0.71 % (16361)Memory used [KB]: 1766
% 0.50/0.71 % (16361)Time elapsed: 0.011 s
% 0.50/0.71 % (16361)Instructions burned: 37 (million)
% 0.50/0.71 % (16361)------------------------------
% 0.50/0.71 % (16361)------------------------------
% 0.50/0.72 % (16360)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.50/0.72 % (16366)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 (2996ds/55Mi)
% 0.50/0.72 % (16362)Instruction limit reached!
% 0.50/0.72 % (16362)------------------------------
% 0.50/0.72 % (16362)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (16362)Termination reason: Unknown
% 0.50/0.72 % (16362)Termination phase: Saturation
% 0.50/0.72
% 0.50/0.72 % (16362)Memory used [KB]: 2071
% 0.50/0.72 % (16362)Time elapsed: 0.012 s
% 0.50/0.72 % (16362)Instructions burned: 35 (million)
% 0.50/0.72 % (16362)------------------------------
% 0.50/0.72 % (16362)------------------------------
% 0.50/0.72 % (16367)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 (2996ds/50Mi)
% 0.50/0.72 % (16358)Instruction limit reached!
% 0.50/0.72 % (16358)------------------------------
% 0.50/0.72 % (16358)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.72 % (16358)Termination reason: Unknown
% 0.50/0.72 % (16358)Termination phase: Saturation
% 0.50/0.72
% 0.50/0.72 % (16358)Memory used [KB]: 1456
% 0.50/0.72 % (16358)Time elapsed: 0.020 s
% 0.50/0.72 % (16358)Instructions burned: 35 (million)
% 0.50/0.72 % (16358)------------------------------
% 0.50/0.72 % (16358)------------------------------
% 0.50/0.73 % (16363)Instruction limit reached!
% 0.50/0.73 % (16363)------------------------------
% 0.50/0.73 % (16363)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.50/0.73 % (16363)Termination reason: Unknown
% 0.50/0.73 % (16363)Termination phase: Saturation
% 0.50/0.73
% 0.50/0.73 % (16363)Memory used [KB]: 1645
% 0.50/0.73 % (16363)Time elapsed: 0.016 s
% 0.50/0.73 % (16363)Instructions burned: 46 (million)
% 0.50/0.73 % (16363)------------------------------
% 0.50/0.73 % (16363)------------------------------
% 0.50/0.73 % (16368)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 (2996ds/208Mi)
% 0.59/0.73 % (16365)Instruction limit reached!
% 0.59/0.73 % (16365)------------------------------
% 0.59/0.73 % (16365)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.73 % (16365)Termination reason: Unknown
% 0.59/0.73 % (16365)Termination phase: Saturation
% 0.59/0.73
% 0.59/0.73 % (16365)Memory used [KB]: 1700
% 0.59/0.73 % (16365)Time elapsed: 0.027 s
% 0.59/0.73 % (16365)Instructions burned: 56 (million)
% 0.59/0.73 % (16365)------------------------------
% 0.59/0.73 % (16365)------------------------------
% 0.59/0.73 % (16360)First to succeed.
% 0.59/0.73 % (16360)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16357"
% 0.59/0.73 % (16360)Refutation found. Thanks to Tanya!
% 0.59/0.73 % SZS status Theorem for theBenchmark
% 0.59/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 0.59/0.73 % (16360)------------------------------
% 0.59/0.73 % (16360)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.59/0.73 % (16360)Termination reason: Refutation
% 0.59/0.73
% 0.59/0.73 % (16360)Memory used [KB]: 1462
% 0.59/0.73 % (16360)Time elapsed: 0.038 s
% 0.59/0.73 % (16360)Instructions burned: 47 (million)
% 0.59/0.73 % (16357)Success in time 0.396 s
% 0.59/0.73 % Vampire---4.8 exiting
%------------------------------------------------------------------------------