TSTP Solution File: SWC354+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC354+1 : TPTP v8.1.2. 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 : n032.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 : Wed May 1 04:01:39 EDT 2024
% Result : Theorem 0.66s 0.84s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 28
% Syntax : Number of formulae : 140 ( 9 unt; 0 def)
% Number of atoms : 637 ( 157 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 804 ( 307 ~; 319 |; 133 &)
% ( 13 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 10 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 177 ( 127 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f767,plain,
$false,
inference(avatar_sat_refutation,[],[f244,f261,f264,f268,f280,f304,f361,f393,f408,f766]) ).
fof(f766,plain,
( spl11_1
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(avatar_contradiction_clause,[],[f765]) ).
fof(f765,plain,
( $false
| spl11_1
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f764,f375]) ).
fof(f375,plain,
( ssList(sK6(sK3))
| ~ spl11_9 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f374,plain,
( spl11_9
<=> ssList(sK6(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_9])]) ).
fof(f764,plain,
( ~ ssList(sK6(sK3))
| spl11_1
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f763,f162]) ).
fof(f162,plain,
ssList(sK2),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f99,f140,f139,f138,f137]) ).
fof(f137,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ segmentP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| sK2 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ~ segmentP(X1,X0)
& ! [X4] :
( ! [X5] :
( ~ neq(nil,X3)
| hd(X3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5) )
| X2 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3
& 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)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( segmentP(X1,X0)
| ? [X4] :
( ? [X5] :
( neq(nil,X3)
& hd(X3) = X5
& cons(X5,nil) = X4
& ssItem(X5) )
& X2 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',co1) ).
fof(f763,plain,
( ~ ssList(sK2)
| ~ ssList(sK6(sK3))
| spl11_1
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(subsumption_resolution,[],[f753,f239]) ).
fof(f239,plain,
( ~ segmentP(sK3,sK2)
| spl11_1 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl11_1
<=> segmentP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
fof(f753,plain,
( segmentP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK6(sK3))
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(superposition,[],[f564,f481]) ).
fof(f481,plain,
( sK3 = app(sK2,sK6(sK3))
| ~ spl11_4
| ~ spl11_5
| ~ spl11_8
| ~ spl11_9 ),
inference(forward_demodulation,[],[f477,f360]) ).
fof(f360,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f358]) ).
fof(f358,plain,
( spl11_8
<=> sK3 = cons(hd(sK2),sK6(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
fof(f477,plain,
( cons(hd(sK2),sK6(sK3)) = app(sK2,sK6(sK3))
| ~ spl11_4
| ~ spl11_5
| ~ spl11_9 ),
inference(resolution,[],[f390,f375]) ).
fof(f390,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK2),X0) = app(sK2,X0) )
| ~ spl11_4
| ~ spl11_5 ),
inference(forward_demodulation,[],[f385,f321]) ).
fof(f321,plain,
( sK2 = cons(hd(sK2),nil)
| ~ spl11_4
| ~ spl11_5 ),
inference(backward_demodulation,[],[f252,f320]) ).
fof(f320,plain,
( hd(sK3) = hd(sK2)
| ~ spl11_4
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f319,f187]) ).
fof(f187,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax17) ).
fof(f319,plain,
( hd(sK3) = hd(sK2)
| ~ ssList(nil)
| ~ spl11_4
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f317,f255]) ).
fof(f255,plain,
( ssItem(hd(sK3))
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f254,plain,
( spl11_5
<=> ssItem(hd(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f317,plain,
( hd(sK3) = hd(sK2)
| ~ ssItem(hd(sK3))
| ~ ssList(nil)
| ~ spl11_4 ),
inference(superposition,[],[f191,f252]) ).
fof(f191,plain,
! [X0,X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( hd(cons(X1,X0)) = X1
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f23,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> hd(cons(X1,X0)) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax23) ).
fof(f252,plain,
( sK2 = cons(hd(sK3),nil)
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f250,plain,
( spl11_4
<=> sK2 = cons(hd(sK3),nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f385,plain,
( ! [X0] :
( cons(hd(sK2),X0) = app(cons(hd(sK2),nil),X0)
| ~ ssList(X0) )
| ~ spl11_4
| ~ spl11_5 ),
inference(resolution,[],[f209,f322]) ).
fof(f322,plain,
( ssItem(hd(sK2))
| ~ spl11_4
| ~ spl11_5 ),
inference(backward_demodulation,[],[f255,f320]) ).
fof(f209,plain,
! [X0,X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f129]) ).
fof(f129,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax81) ).
fof(f564,plain,
! [X0,X1] :
( segmentP(app(X0,X1),X0)
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f563,f214]) ).
fof(f214,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax26) ).
fof(f563,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(subsumption_resolution,[],[f560,f187]) ).
fof(f560,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0) ),
inference(duplicate_literal_removal,[],[f555]) ).
fof(f555,plain,
! [X0,X1] :
( ~ ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(nil)
| ~ ssList(X0)
| segmentP(app(X0,X1),X0)
| ~ ssList(X0) ),
inference(superposition,[],[f229,f212]) ).
fof(f212,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax28) ).
fof(f229,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,[],[f203]) ).
fof(f203,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,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) ) )
& ( ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1))
& ssList(sK9(X0,X1)) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9,sK10])],[f154,f156,f155]) ).
fof(f155,plain,
! [X0,X1] :
( ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0,X1] :
( ? [X5] :
( app(app(sK9(X0,X1),X1),X5) = X0
& ssList(X5) )
=> ( app(app(sK9(X0,X1),X1),sK10(X0,X1)) = X0
& ssList(sK10(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f154,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,[],[f153]) ).
fof(f153,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,[],[f125]) ).
fof(f125,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax7) ).
fof(f408,plain,
( ~ spl11_2
| ~ spl11_7 ),
inference(avatar_contradiction_clause,[],[f407]) ).
fof(f407,plain,
( $false
| ~ spl11_2
| ~ spl11_7 ),
inference(subsumption_resolution,[],[f405,f187]) ).
fof(f405,plain,
( ~ ssList(nil)
| ~ spl11_2
| ~ spl11_7 ),
inference(resolution,[],[f396,f234]) ).
fof(f234,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f226]) ).
fof(f226,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f183]) ).
fof(f183,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f107]) ).
fof(f107,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax15) ).
fof(f396,plain,
( neq(nil,nil)
| ~ spl11_2
| ~ spl11_7 ),
inference(backward_demodulation,[],[f242,f356]) ).
fof(f356,plain,
( nil = sK3
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f354]) ).
fof(f354,plain,
( spl11_7
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
fof(f242,plain,
( neq(sK3,nil)
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl11_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f393,plain,
( spl11_7
| spl11_9 ),
inference(avatar_split_clause,[],[f392,f374,f354]) ).
fof(f392,plain,
( nil = sK3
| spl11_9 ),
inference(subsumption_resolution,[],[f391,f163]) ).
fof(f163,plain,
ssList(sK3),
inference(cnf_transformation,[],[f141]) ).
fof(f391,plain,
( nil = sK3
| ~ ssList(sK3)
| spl11_9 ),
inference(resolution,[],[f376,f176]) ).
fof(f176,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f147,plain,
! [X0] :
( ( cons(sK7(X0),sK6(X0)) = X0
& ssItem(sK7(X0))
& ssList(sK6(X0)) )
| nil = X0
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f102,f146,f145]) ).
fof(f145,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
=> ( ? [X2] :
( cons(X2,sK6(X0)) = X0
& ssItem(X2) )
& ssList(sK6(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
! [X0] :
( ? [X2] :
( cons(X2,sK6(X0)) = X0
& ssItem(X2) )
=> ( cons(sK7(X0),sK6(X0)) = X0
& ssItem(sK7(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f102,plain,
! [X0] :
( ? [X1] :
( ? [X2] :
( cons(X2,X1) = X0
& ssItem(X2) )
& ssList(X1) )
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f101]) ).
fof(f101,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax20) ).
fof(f376,plain,
( ~ ssList(sK6(sK3))
| spl11_9 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f361,plain,
( spl11_7
| spl11_8
| ~ spl11_4
| ~ spl11_5 ),
inference(avatar_split_clause,[],[f352,f254,f250,f358,f354]) ).
fof(f352,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| nil = sK3
| ~ spl11_4
| ~ spl11_5 ),
inference(subsumption_resolution,[],[f346,f163]) ).
fof(f346,plain,
( sK3 = cons(hd(sK2),sK6(sK3))
| nil = sK3
| ~ ssList(sK3)
| ~ spl11_4
| ~ spl11_5 ),
inference(superposition,[],[f341,f320]) ).
fof(f341,plain,
! [X0] :
( cons(hd(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f338]) ).
fof(f338,plain,
! [X0] :
( cons(hd(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f178,f332]) ).
fof(f332,plain,
! [X0] :
( hd(X0) = sK7(X0)
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f331,f176]) ).
fof(f331,plain,
! [X0] :
( hd(X0) = sK7(X0)
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f327,f177]) ).
fof(f177,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f327,plain,
! [X0] :
( hd(X0) = sK7(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f191,f178]) ).
fof(f178,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f147]) ).
fof(f304,plain,
( ~ spl11_2
| spl11_6 ),
inference(avatar_contradiction_clause,[],[f303]) ).
fof(f303,plain,
( $false
| ~ spl11_2
| spl11_6 ),
inference(subsumption_resolution,[],[f301,f299]) ).
fof(f299,plain,
( ~ neq(nil,nil)
| spl11_6 ),
inference(backward_demodulation,[],[f260,f296]) ).
fof(f296,plain,
( nil = sK3
| spl11_6 ),
inference(subsumption_resolution,[],[f295,f187]) ).
fof(f295,plain,
( nil = sK3
| ~ ssList(nil)
| spl11_6 ),
inference(subsumption_resolution,[],[f292,f163]) ).
fof(f292,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil)
| spl11_6 ),
inference(resolution,[],[f184,f260]) ).
fof(f184,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f260,plain,
( ~ neq(nil,sK3)
| spl11_6 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f258,plain,
( spl11_6
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f301,plain,
( neq(nil,nil)
| ~ spl11_2
| spl11_6 ),
inference(backward_demodulation,[],[f242,f296]) ).
fof(f280,plain,
( ~ spl11_2
| spl11_5 ),
inference(avatar_contradiction_clause,[],[f279]) ).
fof(f279,plain,
( $false
| ~ spl11_2
| spl11_5 ),
inference(subsumption_resolution,[],[f277,f187]) ).
fof(f277,plain,
( ~ ssList(nil)
| ~ spl11_2
| spl11_5 ),
inference(resolution,[],[f273,f234]) ).
fof(f273,plain,
( neq(nil,nil)
| ~ spl11_2
| spl11_5 ),
inference(backward_demodulation,[],[f242,f270]) ).
fof(f270,plain,
( nil = sK3
| spl11_5 ),
inference(subsumption_resolution,[],[f269,f163]) ).
fof(f269,plain,
( nil = sK3
| ~ ssList(sK3)
| spl11_5 ),
inference(resolution,[],[f192,f256]) ).
fof(f256,plain,
( ~ ssItem(hd(sK3))
| spl11_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f192,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax22) ).
fof(f268,plain,
( ~ spl11_5
| spl11_3 ),
inference(avatar_split_clause,[],[f267,f246,f254]) ).
fof(f246,plain,
( spl11_3
<=> ssList(cons(hd(sK3),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
fof(f267,plain,
( ~ ssItem(hd(sK3))
| spl11_3 ),
inference(subsumption_resolution,[],[f266,f187]) ).
fof(f266,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(nil)
| spl11_3 ),
inference(resolution,[],[f182,f248]) ).
fof(f248,plain,
( ~ ssList(cons(hd(sK3),nil))
| spl11_3 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f182,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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402',ax16) ).
fof(f264,plain,
spl11_2,
inference(avatar_split_clause,[],[f235,f241]) ).
fof(f235,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f219]) ).
fof(f219,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f166,f164,f164]) ).
fof(f164,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f141]) ).
fof(f166,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f141]) ).
fof(f261,plain,
( ~ spl11_3
| spl11_4
| ~ spl11_5
| ~ spl11_6
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f223,f241,f258,f254,f250,f246]) ).
fof(f223,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| sK2 = cons(hd(sK3),nil)
| ~ ssList(cons(hd(sK3),nil)) ),
inference(equality_resolution,[],[f222]) ).
fof(f222,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| cons(hd(sK3),nil) != X4
| ~ ssItem(hd(sK3))
| sK2 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f170]) ).
fof(f170,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| hd(sK3) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK2 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f244,plain,
( ~ spl11_1
| ~ spl11_2 ),
inference(avatar_split_clause,[],[f215,f241,f237]) ).
fof(f215,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK3,sK2) ),
inference(definition_unfolding,[],[f171,f164,f165]) ).
fof(f165,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f141]) ).
fof(f171,plain,
( ~ neq(sK3,nil)
| ~ segmentP(sK1,sK0) ),
inference(cnf_transformation,[],[f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWC354+1 : TPTP v8.1.2. Released v2.4.0.
% 0.05/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.33 % Computer : n032.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Apr 30 18:27:51 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.11/0.33 This is a FOF_THM_RFO_SEQ problem
% 0.11/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/tmp/tmp.Kb23WPFbb3/Vampire---4.8_7402
% 0.66/0.82 % (7519)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.66/0.82 % (7515)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 Vampire---4 for (2995ds/51Mi)
% 0.66/0.82 % (7518)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 Vampire---4 for (2995ds/34Mi)
% 0.66/0.82 % (7517)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.66/0.82 % (7514)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 Vampire---4 for (2995ds/34Mi)
% 0.66/0.82 % (7516)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.66/0.82 % (7520)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 Vampire---4 for (2995ds/83Mi)
% 0.66/0.82 % (7521)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.66/0.83 % (7517)Instruction limit reached!
% 0.66/0.83 % (7517)------------------------------
% 0.66/0.83 % (7517)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.83 % (7517)Termination reason: Unknown
% 0.66/0.83 % (7517)Termination phase: Saturation
% 0.66/0.83
% 0.66/0.83 % (7517)Memory used [KB]: 1635
% 0.66/0.83 % (7517)Time elapsed: 0.018 s
% 0.66/0.83 % (7517)Instructions burned: 33 (million)
% 0.66/0.83 % (7517)------------------------------
% 0.66/0.83 % (7517)------------------------------
% 0.66/0.84 % (7514)Instruction limit reached!
% 0.66/0.84 % (7514)------------------------------
% 0.66/0.84 % (7514)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.84 % (7514)Termination reason: Unknown
% 0.66/0.84 % (7514)Termination phase: Saturation
% 0.66/0.84
% 0.66/0.84 % (7514)Memory used [KB]: 1445
% 0.66/0.84 % (7514)Time elapsed: 0.019 s
% 0.66/0.84 % (7514)Instructions burned: 34 (million)
% 0.66/0.84 % (7514)------------------------------
% 0.66/0.84 % (7514)------------------------------
% 0.66/0.84 % (7518)Instruction limit reached!
% 0.66/0.84 % (7518)------------------------------
% 0.66/0.84 % (7518)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.84 % (7518)Termination reason: Unknown
% 0.66/0.84 % (7518)Termination phase: Saturation
% 0.66/0.84
% 0.66/0.84 % (7518)Memory used [KB]: 2010
% 0.66/0.84 % (7518)Time elapsed: 0.019 s
% 0.66/0.84 % (7518)Instructions burned: 35 (million)
% 0.66/0.84 % (7518)------------------------------
% 0.66/0.84 % (7518)------------------------------
% 0.66/0.84 % (7516)First to succeed.
% 0.66/0.84 % (7522)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 Vampire---4 for (2995ds/55Mi)
% 0.66/0.84 % (7523)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 Vampire---4 for (2995ds/50Mi)
% 0.66/0.84 % (7524)lrs+1010_1:2_sil=4000:tgt=ground:nwc=10.0:st=2.0:i=208:sd=1:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/208Mi)
% 0.66/0.84 % (7519)Instruction limit reached!
% 0.66/0.84 % (7519)------------------------------
% 0.66/0.84 % (7519)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.84 % (7519)Termination reason: Unknown
% 0.66/0.84 % (7519)Termination phase: Saturation
% 0.66/0.84
% 0.66/0.84 % (7519)Memory used [KB]: 1619
% 0.66/0.84 % (7519)Time elapsed: 0.024 s
% 0.66/0.84 % (7519)Instructions burned: 46 (million)
% 0.66/0.84 % (7519)------------------------------
% 0.66/0.84 % (7519)------------------------------
% 0.66/0.84 % (7516)Refutation found. Thanks to Tanya!
% 0.66/0.84 % SZS status Theorem for Vampire---4
% 0.66/0.84 % SZS output start Proof for Vampire---4
% See solution above
% 0.66/0.84 % (7516)------------------------------
% 0.66/0.84 % (7516)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.66/0.84 % (7516)Termination reason: Refutation
% 0.66/0.84
% 0.66/0.84 % (7516)Memory used [KB]: 1411
% 0.66/0.84 % (7516)Time elapsed: 0.023 s
% 0.66/0.84 % (7516)Instructions burned: 42 (million)
% 0.66/0.84 % (7516)------------------------------
% 0.66/0.84 % (7516)------------------------------
% 0.66/0.84 % (7510)Success in time 0.494 s
% 0.66/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------