TSTP Solution File: SWC366+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC366+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 : n031.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:43 EDT 2024
% Result : Theorem 0.60s 0.81s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 20
% Syntax : Number of formulae : 96 ( 9 unt; 0 def)
% Number of atoms : 493 ( 120 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 653 ( 256 ~; 248 |; 114 &)
% ( 12 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 130 ( 95 !; 35 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f367,plain,
$false,
inference(avatar_sat_refutation,[],[f244,f265,f268,f274,f277,f292,f310,f327,f366]) ).
fof(f366,plain,
( spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f365]) ).
fof(f365,plain,
( $false
| spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f364,f162]) ).
fof(f162,plain,
ssList(sK3),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK3)
| hd(sK3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK2) != X4
| ~ ssList(X5) )
| sK3 = 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) )
| ( ~ rearsegP(X1,X0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ rearsegP(X1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ rearsegP(X1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(X1,nil) ) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ~ neq(X3,nil)
& neq(sK1,nil) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK2) != X4
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK2) != X4
| ~ ssList(X5) )
| X3 = X4
| ~ ssList(X4) )
& neq(sK1,nil) ) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ~ neq(sK3,nil)
& neq(sK1,nil) )
| ( ~ rearsegP(sK1,sK0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,sK3)
| hd(sK3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,sK2) != X4
| ~ ssList(X5) )
| sK3 = 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) )
| ( ~ rearsegP(X1,X0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = 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) )
| ( ~ rearsegP(X1,X0)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(nil,X3)
| hd(X3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6) )
| app(X5,X2) != X4
| ~ ssList(X5) )
| X3 = 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) )
& ( rearsegP(X1,X0)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& app(X5,X2) = X4
& ssList(X5) )
& X3 != 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) )
& ( rearsegP(X1,X0)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(nil,X3)
& hd(X3) = X6
& cons(X6,nil) = X5
& ssItem(X6) )
& app(X5,X2) = X4
& ssList(X5) )
& X3 != X4
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6gYZ2tqDvQ/Vampire---4.8_23289',co1) ).
fof(f364,plain,
( ~ ssList(sK3)
| spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f363,f161]) ).
fof(f161,plain,
ssList(sK2),
inference(cnf_transformation,[],[f141]) ).
fof(f363,plain,
( ~ ssList(sK2)
| ~ ssList(sK3)
| spl10_1
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f362,f255]) ).
fof(f255,plain,
( ssList(cons(hd(sK3),nil))
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f254,plain,
( spl10_5
<=> ssList(cons(hd(sK3),nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f362,plain,
( ~ ssList(cons(hd(sK3),nil))
| ~ ssList(sK2)
| ~ ssList(sK3)
| spl10_1
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f340,f239]) ).
fof(f239,plain,
( ~ rearsegP(sK3,sK2)
| spl10_1 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl10_1
<=> rearsegP(sK3,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f340,plain,
( rearsegP(sK3,sK2)
| ~ ssList(cons(hd(sK3),nil))
| ~ ssList(sK2)
| ~ ssList(sK3)
| ~ spl10_4 ),
inference(superposition,[],[f231,f252]) ).
fof(f252,plain,
( sK3 = app(cons(hd(sK3),nil),sK2)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f250,plain,
( spl10_4
<=> sK3 = app(cons(hd(sK3),nil),sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f231,plain,
! [X2,X1] :
( rearsegP(app(X2,X1),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X2,X1)) ),
inference(equality_resolution,[],[f212]) ).
fof(f212,plain,
! [X2,X0,X1] :
( rearsegP(X0,X1)
| app(X2,X1) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f158,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ( app(sK9(X0,X1),X1) = X0
& ssList(sK9(X0,X1)) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK9])],[f156,f157]) ).
fof(f157,plain,
! [X0,X1] :
( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
=> ( app(sK9(X0,X1),X1) = X0
& ssList(sK9(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X3,X1) = X0
& ssList(X3) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f155]) ).
fof(f155,plain,
! [X0] :
( ! [X1] :
( ( ( rearsegP(X0,X1)
| ! [X2] :
( app(X2,X1) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X2,X1) = X0
& ssList(X2) )
| ~ rearsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f6]) ).
fof(f6,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( rearsegP(X0,X1)
<=> ? [X2] :
( app(X2,X1) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6gYZ2tqDvQ/Vampire---4.8_23289',ax6) ).
fof(f327,plain,
( ~ spl10_2
| ~ spl10_10 ),
inference(avatar_contradiction_clause,[],[f326]) ).
fof(f326,plain,
( $false
| ~ spl10_2
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f324,f197]) ).
fof(f197,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.6gYZ2tqDvQ/Vampire---4.8_23289',ax17) ).
fof(f324,plain,
( ~ ssList(nil)
| ~ spl10_2
| ~ spl10_10 ),
inference(resolution,[],[f313,f233]) ).
fof(f233,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f228]) ).
fof(f228,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f193]) ).
fof(f193,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f150,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/tmp/tmp.6gYZ2tqDvQ/Vampire---4.8_23289',ax15) ).
fof(f313,plain,
( neq(nil,nil)
| ~ spl10_2
| ~ spl10_10 ),
inference(superposition,[],[f242,f306]) ).
fof(f306,plain,
( nil = sK3
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f304]) ).
fof(f304,plain,
( spl10_10
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
fof(f242,plain,
( neq(sK3,nil)
| ~ spl10_2 ),
inference(avatar_component_clause,[],[f241]) ).
fof(f241,plain,
( spl10_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f310,plain,
( spl10_10
| spl10_7 ),
inference(avatar_split_clause,[],[f309,f262,f304]) ).
fof(f262,plain,
( spl10_7
<=> neq(nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f309,plain,
( nil = sK3
| spl10_7 ),
inference(subsumption_resolution,[],[f308,f197]) ).
fof(f308,plain,
( nil = sK3
| ~ ssList(nil)
| spl10_7 ),
inference(subsumption_resolution,[],[f294,f162]) ).
fof(f294,plain,
( nil = sK3
| ~ ssList(sK3)
| ~ ssList(nil)
| spl10_7 ),
inference(resolution,[],[f264,f194]) ).
fof(f194,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f150]) ).
fof(f264,plain,
( ~ neq(nil,sK3)
| spl10_7 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f292,plain,
( ~ spl10_2
| spl10_6 ),
inference(avatar_contradiction_clause,[],[f291]) ).
fof(f291,plain,
( $false
| ~ spl10_2
| spl10_6 ),
inference(subsumption_resolution,[],[f290,f197]) ).
fof(f290,plain,
( ~ ssList(nil)
| ~ spl10_2
| spl10_6 ),
inference(resolution,[],[f282,f233]) ).
fof(f282,plain,
( neq(nil,nil)
| ~ spl10_2
| spl10_6 ),
inference(superposition,[],[f242,f279]) ).
fof(f279,plain,
( nil = sK3
| spl10_6 ),
inference(subsumption_resolution,[],[f278,f162]) ).
fof(f278,plain,
( nil = sK3
| ~ ssList(sK3)
| spl10_6 ),
inference(resolution,[],[f260,f202]) ).
fof(f202,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f125]) ).
fof(f125,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.6gYZ2tqDvQ/Vampire---4.8_23289',ax22) ).
fof(f260,plain,
( ~ ssItem(hd(sK3))
| spl10_6 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f258,plain,
( spl10_6
<=> ssItem(hd(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f277,plain,
( ~ spl10_6
| spl10_5 ),
inference(avatar_split_clause,[],[f276,f254,f258]) ).
fof(f276,plain,
( ~ ssItem(hd(sK3))
| spl10_5 ),
inference(subsumption_resolution,[],[f275,f197]) ).
fof(f275,plain,
( ~ ssItem(hd(sK3))
| ~ ssList(nil)
| spl10_5 ),
inference(resolution,[],[f256,f181]) ).
fof(f181,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.6gYZ2tqDvQ/Vampire---4.8_23289',ax16) ).
fof(f256,plain,
( ~ ssList(cons(hd(sK3),nil))
| spl10_5 ),
inference(avatar_component_clause,[],[f254]) ).
fof(f274,plain,
( ~ spl10_5
| spl10_3 ),
inference(avatar_split_clause,[],[f273,f246,f254]) ).
fof(f246,plain,
( spl10_3
<=> ssList(app(cons(hd(sK3),nil),sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f273,plain,
( ~ ssList(cons(hd(sK3),nil))
| spl10_3 ),
inference(subsumption_resolution,[],[f272,f161]) ).
fof(f272,plain,
( ~ ssList(sK2)
| ~ ssList(cons(hd(sK3),nil))
| spl10_3 ),
inference(resolution,[],[f248,f192]) ).
fof(f192,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/tmp/tmp.6gYZ2tqDvQ/Vampire---4.8_23289',ax26) ).
fof(f248,plain,
( ~ ssList(app(cons(hd(sK3),nil),sK2))
| spl10_3 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f268,plain,
spl10_2,
inference(avatar_split_clause,[],[f235,f241]) ).
fof(f235,plain,
neq(sK3,nil),
inference(duplicate_literal_removal,[],[f217]) ).
fof(f217,plain,
( neq(sK3,nil)
| neq(sK3,nil) ),
inference(definition_unfolding,[],[f165,f163,f163]) ).
fof(f163,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f141]) ).
fof(f165,plain,
( neq(sK1,nil)
| neq(sK1,nil) ),
inference(cnf_transformation,[],[f141]) ).
fof(f265,plain,
( ~ spl10_3
| spl10_4
| ~ spl10_5
| ~ spl10_6
| ~ spl10_7
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f222,f241,f262,f258,f254,f250,f246]) ).
fof(f222,plain,
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| ~ ssList(cons(hd(sK3),nil))
| sK3 = app(cons(hd(sK3),nil),sK2)
| ~ ssList(app(cons(hd(sK3),nil),sK2)) ),
inference(equality_resolution,[],[f221]) ).
fof(f221,plain,
! [X4] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| ~ ssItem(hd(sK3))
| app(cons(hd(sK3),nil),sK2) != X4
| ~ ssList(cons(hd(sK3),nil))
| sK3 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f220]) ).
fof(f220,plain,
! [X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| cons(hd(sK3),nil) != X5
| ~ ssItem(hd(sK3))
| app(X5,sK2) != X4
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f169]) ).
fof(f169,plain,
! [X6,X4,X5] :
( ~ neq(sK3,nil)
| ~ neq(nil,sK3)
| hd(sK3) != X6
| cons(X6,nil) != X5
| ~ ssItem(X6)
| app(X5,sK2) != X4
| ~ ssList(X5)
| sK3 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f141]) ).
fof(f244,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f213,f241,f237]) ).
fof(f213,plain,
( ~ neq(sK3,nil)
| ~ rearsegP(sK3,sK2) ),
inference(definition_unfolding,[],[f170,f163,f164]) ).
fof(f164,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f141]) ).
fof(f170,plain,
( ~ neq(sK3,nil)
| ~ rearsegP(sK1,sK0) ),
inference(cnf_transformation,[],[f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : SWC366+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.10/0.31 % Computer : n031.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Apr 30 18:52:29 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a FOF_THM_RFO_SEQ problem
% 0.10/0.31 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.6gYZ2tqDvQ/Vampire---4.8_23289
% 0.60/0.80 % (23399)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.60/0.80 % (23401)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.60/0.80 % (23400)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.60/0.80 % (23402)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.60/0.80 % (23403)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.60/0.80 % (23404)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.60/0.80 % (23405)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.60/0.80 % (23406)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.60/0.80 % (23404)First to succeed.
% 0.60/0.81 % (23401)Also succeeded, but the first one will report.
% 0.60/0.81 % (23404)Refutation found. Thanks to Tanya!
% 0.60/0.81 % SZS status Theorem for Vampire---4
% 0.60/0.81 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.81 % (23404)------------------------------
% 0.60/0.81 % (23404)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.81 % (23404)Termination reason: Refutation
% 0.60/0.81
% 0.60/0.81 % (23404)Memory used [KB]: 1186
% 0.60/0.81 % (23404)Time elapsed: 0.008 s
% 0.60/0.81 % (23404)Instructions burned: 11 (million)
% 0.60/0.81 % (23404)------------------------------
% 0.60/0.81 % (23404)------------------------------
% 0.60/0.81 % (23397)Success in time 0.488 s
% 0.60/0.81 % Vampire---4.8 exiting
%------------------------------------------------------------------------------