TSTP Solution File: SWC100+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC100+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% Computer : n028.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 : Thu Aug 31 20:56:33 EDT 2023
% Result : Theorem 0.23s 0.44s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 18
% Syntax : Number of formulae : 92 ( 13 unt; 0 def)
% Number of atoms : 547 ( 190 equ)
% Maximal formula atoms : 46 ( 5 avg)
% Number of connectives : 723 ( 268 ~; 248 |; 172 &)
% ( 13 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 148 (; 100 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f866,plain,
$false,
inference(avatar_sat_refutation,[],[f588,f593,f598,f608,f735,f765,f803,f804,f833,f844,f865]) ).
fof(f865,plain,
( spl52_1
| ~ spl52_7 ),
inference(avatar_contradiction_clause,[],[f864]) ).
fof(f864,plain,
( $false
| spl52_1
| ~ spl52_7 ),
inference(subsumption_resolution,[],[f857,f579]) ).
fof(f579,plain,
( nil != sK0
| spl52_1 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f577,plain,
( spl52_1
<=> nil = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_1])]) ).
fof(f857,plain,
( nil = sK0
| ~ spl52_7 ),
inference(superposition,[],[f342,f606]) ).
fof(f606,plain,
( nil = sK2
| ~ spl52_7 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f605,plain,
( spl52_7
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_7])]) ).
fof(f342,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f228]) ).
fof(f228,plain,
( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(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])],[f99,f227,f226,f225,f224,f223]) ).
fof(f223,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f224,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,sK0)
| ~ neq(sK0,nil) )
& neq(X1,nil) )
| ( nil != sK0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f225,plain,
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f226,plain,
( ? [X3] :
( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( ( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f227,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ( ~ frontsegP(X1,X0)
| ~ neq(X0,nil) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& 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)
=> ( ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(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)
=> ( ( ( ( frontsegP(X1,X0)
& neq(X0,nil) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580',co1) ).
fof(f844,plain,
( ~ spl52_1
| spl52_2
| ~ spl52_4
| ~ spl52_5 ),
inference(avatar_contradiction_clause,[],[f843]) ).
fof(f843,plain,
( $false
| ~ spl52_1
| spl52_2
| ~ spl52_4
| ~ spl52_5 ),
inference(subsumption_resolution,[],[f840,f812]) ).
fof(f812,plain,
( ~ neq(nil,nil)
| ~ spl52_1
| spl52_2 ),
inference(superposition,[],[f583,f578]) ).
fof(f578,plain,
( nil = sK0
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f577]) ).
fof(f583,plain,
( ~ neq(sK0,nil)
| spl52_2 ),
inference(avatar_component_clause,[],[f581]) ).
fof(f581,plain,
( spl52_2
<=> neq(sK0,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_2])]) ).
fof(f840,plain,
( neq(nil,nil)
| ~ spl52_4
| ~ spl52_5 ),
inference(superposition,[],[f597,f592]) ).
fof(f592,plain,
( nil = sK1
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f590]) ).
fof(f590,plain,
( spl52_4
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_4])]) ).
fof(f597,plain,
( neq(sK1,nil)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f595]) ).
fof(f595,plain,
( spl52_5
<=> neq(sK1,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_5])]) ).
fof(f833,plain,
( spl52_4
| ~ spl52_6 ),
inference(avatar_split_clause,[],[f826,f601,f590]) ).
fof(f601,plain,
( spl52_6
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl52_6])]) ).
fof(f826,plain,
( nil = sK1
| ~ spl52_6 ),
inference(superposition,[],[f603,f341]) ).
fof(f341,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f228]) ).
fof(f603,plain,
( nil = sK3
| ~ spl52_6 ),
inference(avatar_component_clause,[],[f601]) ).
fof(f804,plain,
( ~ spl52_1
| spl52_7 ),
inference(avatar_split_clause,[],[f613,f605,f577]) ).
fof(f613,plain,
( nil != sK0
| spl52_7 ),
inference(superposition,[],[f607,f342]) ).
fof(f607,plain,
( nil != sK2
| spl52_7 ),
inference(avatar_component_clause,[],[f605]) ).
fof(f803,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f802,f581,f577]) ).
fof(f802,plain,
( nil = sK0
| spl52_2 ),
inference(subsumption_resolution,[],[f801,f610]) ).
fof(f610,plain,
ssList(sK0),
inference(forward_demodulation,[],[f339,f342]) ).
fof(f339,plain,
ssList(sK2),
inference(cnf_transformation,[],[f228]) ).
fof(f801,plain,
( nil = sK0
| ~ ssList(sK0)
| spl52_2 ),
inference(subsumption_resolution,[],[f784,f360]) ).
fof(f360,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580',ax17) ).
fof(f784,plain,
( nil = sK0
| ~ ssList(nil)
| ~ ssList(sK0)
| spl52_2 ),
inference(resolution,[],[f583,f513]) ).
fof(f513,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f318]) ).
fof(f318,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f198]) ).
fof(f198,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/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580',ax15) ).
fof(f765,plain,
( ~ spl52_4
| spl52_7 ),
inference(avatar_split_clause,[],[f764,f605,f590]) ).
fof(f764,plain,
( nil != sK1
| spl52_7 ),
inference(subsumption_resolution,[],[f763,f610]) ).
fof(f763,plain,
( ~ ssList(sK0)
| nil != sK1
| spl52_7 ),
inference(forward_demodulation,[],[f667,f342]) ).
fof(f667,plain,
( nil != sK1
| ~ ssList(sK2)
| spl52_7 ),
inference(forward_demodulation,[],[f666,f341]) ).
fof(f666,plain,
( nil != sK3
| ~ ssList(sK2)
| spl52_7 ),
inference(subsumption_resolution,[],[f665,f343]) ).
fof(f343,plain,
ssList(sK4),
inference(cnf_transformation,[],[f228]) ).
fof(f665,plain,
( nil != sK3
| ~ ssList(sK4)
| ~ ssList(sK2)
| spl52_7 ),
inference(subsumption_resolution,[],[f621,f607]) ).
fof(f621,plain,
( nil != sK3
| nil = sK2
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f525,f344]) ).
fof(f344,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f228]) ).
fof(f525,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f333]) ).
fof(f333,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,[],[f332]) ).
fof(f332,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,[],[f202]) ).
fof(f202,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/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580',ax83) ).
fof(f735,plain,
spl52_3,
inference(avatar_split_clause,[],[f734,f585]) ).
fof(f585,plain,
( spl52_3
<=> frontsegP(sK1,sK0) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_3])]) ).
fof(f734,plain,
frontsegP(sK1,sK0),
inference(subsumption_resolution,[],[f733,f609]) ).
fof(f609,plain,
ssList(sK1),
inference(forward_demodulation,[],[f340,f341]) ).
fof(f340,plain,
ssList(sK3),
inference(cnf_transformation,[],[f228]) ).
fof(f733,plain,
( ~ ssList(sK1)
| frontsegP(sK1,sK0) ),
inference(forward_demodulation,[],[f732,f341]) ).
fof(f732,plain,
( frontsegP(sK1,sK0)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f731,f610]) ).
fof(f731,plain,
( ~ ssList(sK0)
| frontsegP(sK1,sK0)
| ~ ssList(sK3) ),
inference(forward_demodulation,[],[f725,f342]) ).
fof(f725,plain,
( frontsegP(sK1,sK0)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(forward_demodulation,[],[f724,f341]) ).
fof(f724,plain,
( frontsegP(sK3,sK0)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(forward_demodulation,[],[f723,f342]) ).
fof(f723,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(subsumption_resolution,[],[f632,f343]) ).
fof(f632,plain,
( frontsegP(sK3,sK2)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ ssList(sK3) ),
inference(superposition,[],[f566,f344]) ).
fof(f566,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(app(X1,X2)) ),
inference(equality_resolution,[],[f523]) ).
fof(f523,plain,
! [X2,X0,X1] :
( frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f331]) ).
fof(f331,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK49(X0,X1)) = X0
& ssList(sK49(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK49])],[f329,f330]) ).
fof(f330,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK49(X0,X1)) = X0
& ssList(sK49(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f329,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f328]) ).
fof(f328,plain,
! [X0] :
( ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f201]) ).
fof(f201,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580',ax5) ).
fof(f608,plain,
( spl52_6
| ~ spl52_7 ),
inference(avatar_split_clause,[],[f347,f605,f601]) ).
fof(f347,plain,
( nil != sK2
| nil = sK3 ),
inference(cnf_transformation,[],[f228]) ).
fof(f598,plain,
( ~ spl52_1
| spl52_5 ),
inference(avatar_split_clause,[],[f349,f595,f577]) ).
fof(f349,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f228]) ).
fof(f593,plain,
( spl52_4
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f350,f585,f581,f590]) ).
fof(f350,plain,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f228]) ).
fof(f588,plain,
( ~ spl52_1
| ~ spl52_2
| ~ spl52_3 ),
inference(avatar_split_clause,[],[f351,f585,f581,f577]) ).
fof(f351,plain,
( ~ frontsegP(sK1,sK0)
| ~ neq(sK0,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f228]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWC100+1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.15 % Command : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
% 0.14/0.36 % Computer : n028.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Aug 28 18:01:10 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/0.36 Running vampire_casc2023 --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/tmp/tmp.7weYKAZk68/Vampire---4.8_580
% 0.14/0.37 % (899)Running in auto input_syntax mode. Trying TPTP
% 0.23/0.43 % (911)lrs-1004_3_av=off:ep=RSTC:fsd=off:fsr=off:urr=ec_only:stl=62_525 on Vampire---4 for (525ds/0Mi)
% 0.23/0.43 % (910)lrs+1011_1_bd=preordered:flr=on:fsd=off:fsr=off:irw=on:lcm=reverse:msp=off:nm=2:nwc=10.0:sos=on:sp=reverse_weighted_frequency:tgt=full:stl=62_562 on Vampire---4 for (562ds/0Mi)
% 0.23/0.43 % (916)lrs+10_1024_av=off:bsr=on:br=off:ep=RSTC:fsd=off:irw=on:nm=4:nwc=1.1:sims=off:urr=on:stl=125_440 on Vampire---4 for (440ds/0Mi)
% 0.23/0.43 % (917)ott+1010_2:5_bd=off:fsd=off:fde=none:nm=16:sos=on_419 on Vampire---4 for (419ds/0Mi)
% 0.23/0.43 % (913)ott+1011_4_er=known:fsd=off:nm=4:tgt=ground_499 on Vampire---4 for (499ds/0Mi)
% 0.23/0.43 % (914)ott+11_8:1_aac=none:amm=sco:anc=none:er=known:flr=on:fde=unused:irw=on:nm=0:nwc=1.2:nicw=on:sims=off:sos=all:sac=on_470 on Vampire---4 for (470ds/0Mi)
% 0.23/0.44 % (912)lrs+10_4:5_amm=off:bsr=on:bce=on:flr=on:fsd=off:fde=unused:gs=on:gsem=on:lcm=predicate:sos=all:tgt=ground:stl=62_514 on Vampire---4 for (514ds/0Mi)
% 0.23/0.44 % (917)First to succeed.
% 0.23/0.44 % (913)Also succeeded, but the first one will report.
% 0.23/0.44 % (917)Refutation found. Thanks to Tanya!
% 0.23/0.44 % SZS status Theorem for Vampire---4
% 0.23/0.44 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.44 % (917)------------------------------
% 0.23/0.44 % (917)Version: Vampire 4.7 (commit 05ef610bd on 2023-06-21 19:03:17 +0100)
% 0.23/0.44 % (917)Linked with Z3 4.9.1.0 6ed071b44407cf6623b8d3c0dceb2a8fb7040cee z3-4.8.4-6427-g6ed071b44
% 0.23/0.44 % (917)Termination reason: Refutation
% 0.23/0.44
% 0.23/0.44 % (917)Memory used [KB]: 6012
% 0.23/0.44 % (917)Time elapsed: 0.013 s
% 0.23/0.44 % (917)------------------------------
% 0.23/0.44 % (917)------------------------------
% 0.23/0.44 % (899)Success in time 0.078 s
% 0.23/0.44 % Vampire---4.8 exiting
%------------------------------------------------------------------------------