TSTP Solution File: SWC039+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC039+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 : n010.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 : Sun May 5 09:48:09 EDT 2024
% Result : Theorem 0.49s 0.71s
% Output : Refutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 14
% Syntax : Number of formulae : 76 ( 11 unt; 0 def)
% Number of atoms : 465 ( 181 equ)
% Maximal formula atoms : 22 ( 6 avg)
% Number of connectives : 580 ( 191 ~; 169 |; 183 &)
% ( 4 <=>; 33 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 3 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 150 ( 92 !; 58 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1026,plain,
$false,
inference(avatar_sat_refutation,[],[f267,f268,f1025]) ).
fof(f1025,plain,
( ~ spl14_1
| spl14_2 ),
inference(avatar_contradiction_clause,[],[f1024]) ).
fof(f1024,plain,
( $false
| ~ spl14_1
| spl14_2 ),
inference(subsumption_resolution,[],[f1023,f265]) ).
fof(f265,plain,
( sK6 != sK7
| spl14_2 ),
inference(avatar_component_clause,[],[f264]) ).
fof(f264,plain,
( spl14_2
<=> sK6 = sK7 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f1023,plain,
( sK6 = sK7
| ~ spl14_1 ),
inference(forward_demodulation,[],[f980,f269]) ).
fof(f269,plain,
sK6 = app(sK7,sK6),
inference(resolution,[],[f248,f179]) ).
fof(f179,plain,
ssList(sK6),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& nil != sK4
& sK4 = sK6
& sK5 = sK7
& nil = sK5
& ssList(sK7)
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7])],[f139,f149,f148,f147,f146]) ).
fof(f146,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != sK4
& sK4 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != sK4
& sK4 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != sK4
& sK4 = X2
& sK5 = X3
& nil = sK5
& ssList(X3) )
& ssList(X2) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != sK4
& sK4 = X2
& sK5 = X3
& nil = sK5
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& nil != sK4
& sK4 = sK6
& sK5 = X3
& nil = sK5
& ssList(X3) )
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X3] :
( ( ( nil = sK6
& nil = X3 )
| sP0(X3,sK6) )
& nil != sK4
& sK4 = sK6
& sK5 = X3
& nil = sK5
& ssList(X3) )
=> ( ( ( nil = sK6
& nil = sK7 )
| sP0(sK7,sK6) )
& nil != sK4
& sK4 = sK6
& sK5 = sK7
& nil = sK5
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| sP0(X3,X2) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f100,f138]) ).
fof(f138,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& 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] :
( ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X7] :
( lt(X7,X4)
& memberP(X6,X7)
& ssItem(X7) )
| ? [X8] :
( lt(X4,X8)
& memberP(X5,X8)
& ssItem(X8) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| 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)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.6gAnczSz9P/Vampire---4.8_13010',co1) ).
fof(f248,plain,
! [X0] :
( ~ ssList(X0)
| app(sK7,X0) = X0 ),
inference(definition_unfolding,[],[f206,f232]) ).
fof(f232,plain,
nil = sK7,
inference(definition_unfolding,[],[f181,f182]) ).
fof(f182,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f150]) ).
fof(f181,plain,
nil = sK5,
inference(cnf_transformation,[],[f150]) ).
fof(f206,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,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.6gAnczSz9P/Vampire---4.8_13010',ax28) ).
fof(f980,plain,
( sK7 = app(sK7,sK6)
| ~ spl14_1 ),
inference(backward_demodulation,[],[f892,f944]) ).
fof(f944,plain,
( sK7 = sK2(sK7,sK6)
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f943,f334]) ).
fof(f334,plain,
( ssList(sK2(sK7,sK6))
| ~ spl14_1 ),
inference(resolution,[],[f171,f262]) ).
fof(f262,plain,
( sP0(sK7,sK6)
| ~ spl14_1 ),
inference(avatar_component_clause,[],[f260]) ).
fof(f260,plain,
( spl14_1
<=> sP0(sK7,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f171,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(sK2(X0,X1)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f145,plain,
! [X0,X1] :
( ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1))
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3])],[f141,f144,f143,f142]) ).
fof(f142,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
=> ( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
! [X0,X1] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(X3) )
=> ( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
& ssList(sK2(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0,X1] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),X4) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(X4) )
=> ( ! [X5] :
( ~ lt(X5,sK1(X0,X1))
| ~ memberP(sK3(X0,X1),X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(sK1(X0,X1),X6)
| ~ memberP(sK2(X0,X1),X6)
| ~ ssItem(X6) )
& app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0
& cons(sK1(X0,X1),nil) = X1
& ssList(sK3(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f141,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ! [X5] :
( ~ lt(X5,X2)
| ~ memberP(X4,X5)
| ~ ssItem(X5) )
& ! [X6] :
( ~ lt(X2,X6)
| ~ memberP(X3,X6)
| ~ ssItem(X6) )
& app(app(X3,X1),X4) = X0
& cons(X2,nil) = X1
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f140]) ).
fof(f140,plain,
! [X3,X2] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ! [X7] :
( ~ lt(X7,X4)
| ~ memberP(X6,X7)
| ~ ssItem(X7) )
& ! [X8] :
( ~ lt(X4,X8)
| ~ memberP(X5,X8)
| ~ ssItem(X8) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2
& ssList(X6) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X3,X2) ),
inference(nnf_transformation,[],[f138]) ).
fof(f943,plain,
( sK7 = sK2(sK7,sK6)
| ~ ssList(sK2(sK7,sK6))
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f933,f179]) ).
fof(f933,plain,
( sK7 = sK2(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK2(sK7,sK6))
| ~ spl14_1 ),
inference(trivial_inequality_removal,[],[f932]) ).
fof(f932,plain,
( sK7 != sK7
| sK7 = sK2(sK7,sK6)
| ~ ssList(sK6)
| ~ ssList(sK2(sK7,sK6))
| ~ spl14_1 ),
inference(superposition,[],[f245,f892]) ).
fof(f245,plain,
! [X0,X1] :
( app(X0,X1) != sK7
| sK7 = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f200,f232,f232]) ).
fof(f200,plain,
! [X0,X1] :
( nil = X0
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f158,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,[],[f157]) ).
fof(f157,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,[],[f109]) ).
fof(f109,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/tmp/tmp.6gAnczSz9P/Vampire---4.8_13010',ax83) ).
fof(f892,plain,
( sK7 = app(sK2(sK7,sK6),sK6)
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f891,f180]) ).
fof(f180,plain,
ssList(sK7),
inference(cnf_transformation,[],[f150]) ).
fof(f891,plain,
( ~ ssList(sK7)
| sK7 = app(sK2(sK7,sK6),sK6)
| ~ spl14_1 ),
inference(forward_demodulation,[],[f890,f757]) ).
fof(f757,plain,
( sK7 = sK3(sK7,sK6)
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f756,f351]) ).
fof(f351,plain,
( ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(resolution,[],[f348,f334]) ).
fof(f348,plain,
! [X0] :
( ~ ssList(X0)
| ssList(app(X0,sK6)) ),
inference(resolution,[],[f208,f179]) ).
fof(f208,plain,
! [X0,X1] :
( ~ ssList(X1)
| ssList(app(X0,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/tmp/tmp.6gAnczSz9P/Vampire---4.8_13010',ax26) ).
fof(f756,plain,
( sK7 = sK3(sK7,sK6)
| ~ ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f751,f338]) ).
fof(f338,plain,
( ssList(sK3(sK7,sK6))
| ~ spl14_1 ),
inference(resolution,[],[f172,f262]) ).
fof(f172,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(sK3(X0,X1)) ),
inference(cnf_transformation,[],[f145]) ).
fof(f751,plain,
( sK7 = sK3(sK7,sK6)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(trivial_inequality_removal,[],[f748]) ).
fof(f748,plain,
( sK7 != sK7
| sK7 = sK3(sK7,sK6)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(superposition,[],[f246,f428]) ).
fof(f428,plain,
( sK7 = app(app(sK2(sK7,sK6),sK6),sK3(sK7,sK6))
| ~ spl14_1 ),
inference(resolution,[],[f174,f262]) ).
fof(f174,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| app(app(sK2(X0,X1),X1),sK3(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f145]) ).
fof(f246,plain,
! [X0,X1] :
( app(X0,X1) != sK7
| sK7 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(definition_unfolding,[],[f199,f232,f232]) ).
fof(f199,plain,
! [X0,X1] :
( nil = X1
| nil != app(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f158]) ).
fof(f890,plain,
( sK7 = app(sK2(sK7,sK6),sK6)
| ~ ssList(sK3(sK7,sK6))
| ~ spl14_1 ),
inference(subsumption_resolution,[],[f750,f351]) ).
fof(f750,plain,
( sK7 = app(sK2(sK7,sK6),sK6)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(trivial_inequality_removal,[],[f749]) ).
fof(f749,plain,
( sK7 != sK7
| sK7 = app(sK2(sK7,sK6),sK6)
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(app(sK2(sK7,sK6),sK6))
| ~ spl14_1 ),
inference(superposition,[],[f245,f428]) ).
fof(f268,plain,
~ spl14_2,
inference(avatar_split_clause,[],[f236,f264]) ).
fof(f236,plain,
sK6 != sK7,
inference(definition_unfolding,[],[f184,f232,f183]) ).
fof(f183,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f150]) ).
fof(f184,plain,
nil != sK4,
inference(cnf_transformation,[],[f150]) ).
fof(f267,plain,
( spl14_1
| spl14_2 ),
inference(avatar_split_clause,[],[f234,f264,f260]) ).
fof(f234,plain,
( sK6 = sK7
| sP0(sK7,sK6) ),
inference(definition_unfolding,[],[f186,f232]) ).
fof(f186,plain,
( nil = sK6
| sP0(sK7,sK6) ),
inference(cnf_transformation,[],[f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWC039+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/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.12/0.35 % Computer : n010.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Fri May 3 20:33:08 EDT 2024
% 0.12/0.35 % CPUTime :
% 0.12/0.35 This is a FOF_THM_RFO_SEQ problem
% 0.12/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/tmp/tmp.6gAnczSz9P/Vampire---4.8_13010
% 0.49/0.68 % (13119)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 (2996ds/51Mi)
% 0.49/0.68 % (13121)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.49/0.68 % (13120)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.49/0.68 % (13118)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 (2996ds/34Mi)
% 0.49/0.68 % (13123)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.49/0.68 % (13122)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 (2996ds/34Mi)
% 0.49/0.68 % (13124)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 (2996ds/83Mi)
% 0.49/0.68 % (13125)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 (2996ds/56Mi)
% 0.49/0.70 % (13121)Instruction limit reached!
% 0.49/0.70 % (13121)------------------------------
% 0.49/0.70 % (13121)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.70 % (13122)Instruction limit reached!
% 0.49/0.70 % (13122)------------------------------
% 0.49/0.70 % (13122)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.70 % (13122)Termination reason: Unknown
% 0.49/0.70 % (13122)Termination phase: Saturation
% 0.49/0.70
% 0.49/0.70 % (13122)Memory used [KB]: 1818
% 0.49/0.70 % (13122)Time elapsed: 0.017 s
% 0.49/0.70 % (13122)Instructions burned: 34 (million)
% 0.49/0.70 % (13122)------------------------------
% 0.49/0.70 % (13122)------------------------------
% 0.49/0.70 % (13121)Termination reason: Unknown
% 0.49/0.70 % (13121)Termination phase: Saturation
% 0.49/0.70
% 0.49/0.70 % (13121)Memory used [KB]: 1674
% 0.49/0.70 % (13121)Time elapsed: 0.017 s
% 0.49/0.70 % (13121)Instructions burned: 34 (million)
% 0.49/0.70 % (13121)------------------------------
% 0.49/0.70 % (13121)------------------------------
% 0.49/0.70 % (13119)Instruction limit reached!
% 0.49/0.70 % (13119)------------------------------
% 0.49/0.70 % (13119)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.70 % (13119)Termination reason: Unknown
% 0.49/0.70 % (13119)Termination phase: Saturation
% 0.49/0.70
% 0.49/0.70 % (13119)Memory used [KB]: 1966
% 0.49/0.70 % (13119)Time elapsed: 0.018 s
% 0.49/0.70 % (13119)Instructions burned: 52 (million)
% 0.49/0.70 % (13119)------------------------------
% 0.49/0.70 % (13119)------------------------------
% 0.49/0.70 % (13127)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 (2996ds/50Mi)
% 0.49/0.70 % (13118)Instruction limit reached!
% 0.49/0.70 % (13118)------------------------------
% 0.49/0.70 % (13118)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.70 % (13118)Termination reason: Unknown
% 0.49/0.70 % (13118)Termination phase: Saturation
% 0.49/0.70
% 0.49/0.70 % (13118)Memory used [KB]: 1568
% 0.49/0.70 % (13118)Time elapsed: 0.021 s
% 0.49/0.70 % (13118)Instructions burned: 34 (million)
% 0.49/0.70 % (13118)------------------------------
% 0.49/0.70 % (13118)------------------------------
% 0.49/0.70 % (13126)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 (2996ds/55Mi)
% 0.49/0.70 % (13128)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 (2996ds/208Mi)
% 0.49/0.71 % (13123)Instruction limit reached!
% 0.49/0.71 % (13123)------------------------------
% 0.49/0.71 % (13123)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.71 % (13123)Termination reason: Unknown
% 0.49/0.71 % (13123)Termination phase: Saturation
% 0.49/0.71
% 0.49/0.71 % (13123)Memory used [KB]: 1411
% 0.49/0.71 % (13123)Time elapsed: 0.025 s
% 0.49/0.71 % (13123)Instructions burned: 45 (million)
% 0.49/0.71 % (13123)------------------------------
% 0.49/0.71 % (13123)------------------------------
% 0.49/0.71 % (13120)First to succeed.
% 0.49/0.71 % (13120)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13117"
% 0.49/0.71 % (13120)Refutation found. Thanks to Tanya!
% 0.49/0.71 % SZS status Theorem for Vampire---4
% 0.49/0.71 % SZS output start Proof for Vampire---4
% See solution above
% 0.49/0.71 % (13120)------------------------------
% 0.49/0.71 % (13120)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.49/0.71 % (13120)Termination reason: Refutation
% 0.49/0.71
% 0.49/0.71 % (13120)Memory used [KB]: 1569
% 0.49/0.71 % (13120)Time elapsed: 0.027 s
% 0.49/0.71 % (13120)Instructions burned: 51 (million)
% 0.49/0.71 % (13117)Success in time 0.353 s
% 0.49/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------