TSTP Solution File: SWC018+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC018+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 : n014.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:00 EDT 2024
% Result : Theorem 0.61s 0.80s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 75 ( 8 unt; 0 def)
% Number of atoms : 530 ( 178 equ)
% Maximal formula atoms : 46 ( 7 avg)
% Number of connectives : 736 ( 281 ~; 247 |; 171 &)
% ( 8 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 158 ( 111 !; 47 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f406,plain,
$false,
inference(avatar_sat_refutation,[],[f259,f264,f266,f327,f330,f405]) ).
fof(f405,plain,
( spl14_1
| ~ spl14_2 ),
inference(avatar_contradiction_clause,[],[f404]) ).
fof(f404,plain,
( $false
| spl14_1
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f403,f167]) ).
fof(f167,plain,
ssList(sK2),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f139,f138,f137,f136,f135]) ).
fof(f135,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = X3
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f138,plain,
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = X3
& ssList(X5) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = sK3
& ssList(X5) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f139,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& app(sK2,X5) = sK3
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK4
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ~ frontsegP(X0,X4)
| ~ frontsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& equalelemsP(X2)
& app(X2,X5) = X3
& ssList(X5) )
& 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] :
( ssList(X3)
=> ( ( ( ? [X4] :
( frontsegP(X0,X4)
& frontsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X2
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(X2,X5) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( frontsegP(X0,X8)
& frontsegP(X1,X8)
& neq(X8,nil)
& ssList(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X8] :
( frontsegP(X0,X8)
& frontsegP(X1,X8)
& neq(X8,nil)
& ssList(X8) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( app(X7,cons(X5,nil)) = X2
& ssList(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ equalelemsP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7le1ZaYDqx/Vampire---4.8_12979',co1) ).
fof(f403,plain,
( ~ ssList(sK2)
| spl14_1
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f402,f206]) ).
fof(f206,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.7le1ZaYDqx/Vampire---4.8_12979',ax17) ).
fof(f402,plain,
( ~ ssList(nil)
| ~ ssList(sK2)
| spl14_1
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f391,f250]) ).
fof(f250,plain,
( nil != sK2
| spl14_1 ),
inference(avatar_component_clause,[],[f248]) ).
fof(f248,plain,
( spl14_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_1])]) ).
fof(f391,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2)
| ~ spl14_2 ),
inference(resolution,[],[f388,f203]) ).
fof(f203,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f119,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.7le1ZaYDqx/Vampire---4.8_12979',ax15) ).
fof(f388,plain,
( ~ neq(sK2,nil)
| ~ spl14_2 ),
inference(subsumption_resolution,[],[f387,f167]) ).
fof(f387,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ spl14_2 ),
inference(duplicate_literal_removal,[],[f383]) ).
fof(f383,plain,
( ~ neq(sK2,nil)
| ~ ssList(sK2)
| ~ ssList(sK2)
| ~ spl14_2 ),
inference(resolution,[],[f382,f214]) ).
fof(f214,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/tmp/tmp.7le1ZaYDqx/Vampire---4.8_12979',ax42) ).
fof(f382,plain,
( ! [X0] :
( ~ frontsegP(sK2,X0)
| ~ neq(X0,nil)
| ~ ssList(X0) )
| ~ spl14_2 ),
inference(duplicate_literal_removal,[],[f375]) ).
fof(f375,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ frontsegP(sK2,X0)
| ~ frontsegP(sK2,X0)
| ~ ssList(X0) )
| ~ spl14_2 ),
inference(resolution,[],[f253,f307]) ).
fof(f307,plain,
! [X0] :
( frontsegP(sK3,X0)
| ~ frontsegP(sK2,X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f306,f167]) ).
fof(f306,plain,
! [X0] :
( frontsegP(sK3,X0)
| ~ frontsegP(sK2,X0)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f276,f171]) ).
fof(f171,plain,
ssList(sK4),
inference(cnf_transformation,[],[f140]) ).
fof(f276,plain,
! [X0] :
( frontsegP(sK3,X0)
| ~ frontsegP(sK2,X0)
| ~ ssList(sK4)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(superposition,[],[f213,f172]) ).
fof(f172,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f140]) ).
fof(f213,plain,
! [X2,X0,X1] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( frontsegP(app(X0,X2),X1)
| ~ frontsegP(X0,X1)
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f43]) ).
fof(f43,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( frontsegP(X0,X1)
=> frontsegP(app(X0,X2),X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.7le1ZaYDqx/Vampire---4.8_12979',ax43) ).
fof(f253,plain,
( ! [X4] :
( ~ frontsegP(sK3,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK2,X4) )
| ~ spl14_2 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f252,plain,
( spl14_2
<=> ! [X4] :
( ~ frontsegP(sK2,X4)
| ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(sK3,X4) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_2])]) ).
fof(f330,plain,
( spl14_1
| ~ spl14_3 ),
inference(avatar_split_clause,[],[f329,f256,f248]) ).
fof(f256,plain,
( spl14_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl14_3])]) ).
fof(f329,plain,
( nil != sK3
| nil = sK2 ),
inference(subsumption_resolution,[],[f328,f167]) ).
fof(f328,plain,
( nil != sK3
| nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f269,f171]) ).
fof(f269,plain,
( nil != sK3
| nil = sK2
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f193,f172]) ).
fof(f193,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f148,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,[],[f147]) ).
fof(f147,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.7le1ZaYDqx/Vampire---4.8_12979',ax83) ).
fof(f327,plain,
( ~ spl14_3
| ~ spl14_4 ),
inference(avatar_contradiction_clause,[],[f326]) ).
fof(f326,plain,
( $false
| ~ spl14_3
| ~ spl14_4 ),
inference(subsumption_resolution,[],[f325,f206]) ).
fof(f325,plain,
( ~ ssList(nil)
| ~ spl14_3
| ~ spl14_4 ),
inference(resolution,[],[f316,f244]) ).
fof(f244,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f237]) ).
fof(f237,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f202]) ).
fof(f202,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f316,plain,
( neq(nil,nil)
| ~ spl14_3
| ~ spl14_4 ),
inference(forward_demodulation,[],[f263,f258]) ).
fof(f258,plain,
( nil = sK3
| ~ spl14_3 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f263,plain,
( neq(sK3,nil)
| ~ spl14_4 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f261,plain,
( spl14_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl14_4])]) ).
fof(f266,plain,
( spl14_3
| ~ spl14_1 ),
inference(avatar_split_clause,[],[f175,f248,f256]) ).
fof(f175,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f140]) ).
fof(f264,plain,
( ~ spl14_1
| spl14_4 ),
inference(avatar_split_clause,[],[f231,f261,f248]) ).
fof(f231,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f177,f169,f170]) ).
fof(f170,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f140]) ).
fof(f169,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f140]) ).
fof(f177,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f140]) ).
fof(f259,plain,
( spl14_3
| spl14_2 ),
inference(avatar_split_clause,[],[f230,f252,f256]) ).
fof(f230,plain,
! [X4] :
( ~ frontsegP(sK2,X4)
| ~ frontsegP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK3 ),
inference(definition_unfolding,[],[f178,f170,f169,f169]) ).
fof(f178,plain,
! [X4] :
( ~ frontsegP(sK0,X4)
| ~ frontsegP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK1 ),
inference(cnf_transformation,[],[f140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SWC018+1 : TPTP v8.1.2. Released v2.4.0.
% 0.10/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 : n014.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 : Fri May 3 20:32: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/tmp/tmp.7le1ZaYDqx/Vampire---4.8_12979
% 0.61/0.79 % (13093)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.61/0.79 % (13094)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.61/0.79 % (13090)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.61/0.79 % (13089)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.61/0.79 % (13091)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.61/0.79 % (13092)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.61/0.79 % (13095)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.61/0.79 % (13096)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.61/0.80 % (13094)First to succeed.
% 0.61/0.80 % (13091)Also succeeded, but the first one will report.
% 0.61/0.80 % (13094)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13087"
% 0.61/0.80 % (13094)Refutation found. Thanks to Tanya!
% 0.61/0.80 % SZS status Theorem for Vampire---4
% 0.61/0.80 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.80 % (13094)------------------------------
% 0.61/0.80 % (13094)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.61/0.80 % (13094)Termination reason: Refutation
% 0.61/0.80
% 0.61/0.80 % (13094)Memory used [KB]: 1200
% 0.61/0.80 % (13094)Time elapsed: 0.009 s
% 0.61/0.80 % (13094)Instructions burned: 13 (million)
% 0.61/0.80 % (13087)Success in time 0.462 s
% 0.61/0.80 % Vampire---4.8 exiting
%------------------------------------------------------------------------------