TSTP Solution File: SWC149+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC149+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 : n023.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:00:05 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 40
% Number of leaves : 15
% Syntax : Number of formulae : 87 ( 10 unt; 0 def)
% Number of atoms : 484 ( 141 equ)
% Maximal formula atoms : 24 ( 5 avg)
% Number of connectives : 675 ( 278 ~; 260 |; 107 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 200 ( 155 !; 45 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f550,plain,
$false,
inference(subsumption_resolution,[],[f549,f180]) ).
fof(f180,plain,
~ singletonP(sK3),
inference(definition_unfolding,[],[f148,f144]) ).
fof(f144,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != sK3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(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,f124,f123,f122,f121]) ).
fof(f121,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ singletonP(X1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ singletonP(X1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ singletonP(X1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X2] :
( ? [X3] :
( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X3] :
( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ~ singletonP(sK1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != sK3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ~ singletonP(X1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(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] :
( ~ singletonP(X1)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != X3
| ~ ssList(X6) )
| ~ ssItem(X5) )
| ~ ssItem(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)
=> ( singletonP(X1)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) = X3
& ssList(X6) )
& ssItem(X5) )
& ssItem(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)
=> ( singletonP(X1)
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) = X3
& ssList(X6) )
& ssItem(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IqH3a8oRRZ/Vampire---4.8_24413',co1) ).
fof(f148,plain,
~ singletonP(sK1),
inference(cnf_transformation,[],[f125]) ).
fof(f549,plain,
singletonP(sK3),
inference(subsumption_resolution,[],[f545,f143]) ).
fof(f143,plain,
ssList(sK3),
inference(cnf_transformation,[],[f125]) ).
fof(f545,plain,
( ~ ssList(sK3)
| singletonP(sK3) ),
inference(trivial_inequality_removal,[],[f544]) ).
fof(f544,plain,
( ~ ssList(sK3)
| singletonP(sK3)
| sK3 != sK3 ),
inference(duplicate_literal_removal,[],[f543]) ).
fof(f543,plain,
( ~ ssList(sK3)
| singletonP(sK3)
| sK3 != sK3
| ~ ssList(sK3) ),
inference(resolution,[],[f516,f190]) ).
fof(f190,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f186]) ).
fof(f186,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f171]) ).
fof(f171,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,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.IqH3a8oRRZ/Vampire---4.8_24413',ax15) ).
fof(f516,plain,
! [X0] :
( neq(sK3,X0)
| ~ ssList(X0)
| singletonP(X0)
| sK3 != X0 ),
inference(superposition,[],[f181,f493]) ).
fof(f493,plain,
! [X0] :
( nil = X0
| ~ ssList(X0)
| singletonP(X0)
| sK3 != X0 ),
inference(subsumption_resolution,[],[f487,f154]) ).
fof(f154,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f131,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,f130,f129]) ).
fof(f129,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(f130,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.IqH3a8oRRZ/Vampire---4.8_24413',ax20) ).
fof(f487,plain,
! [X0] :
( singletonP(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| nil = X0
| sK3 != X0 ),
inference(duplicate_literal_removal,[],[f453]) ).
fof(f453,plain,
! [X0] :
( singletonP(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0)
| sK3 != X0 ),
inference(superposition,[],[f188,f446]) ).
fof(f446,plain,
! [X0] :
( cons(sK7(X0),nil) = X0
| nil = X0
| ~ ssList(X0)
| sK3 != X0 ),
inference(duplicate_literal_removal,[],[f437]) ).
fof(f437,plain,
! [X0] :
( cons(sK7(X0),nil) = X0
| nil = X0
| ~ ssList(X0)
| sK3 != X0
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f155,f427]) ).
fof(f427,plain,
! [X0] :
( nil = sK6(X0)
| sK3 != X0
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f426,f154]) ).
fof(f426,plain,
! [X0] :
( sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssItem(sK7(X0)) ),
inference(subsumption_resolution,[],[f425,f175]) ).
fof(f175,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.IqH3a8oRRZ/Vampire---4.8_24413',ax17) ).
fof(f425,plain,
! [X0] :
( sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(nil) ),
inference(resolution,[],[f423,f159]) ).
fof(f159,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.IqH3a8oRRZ/Vampire---4.8_24413',ax16) ).
fof(f423,plain,
! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f422,f154]) ).
fof(f422,plain,
! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(X0),nil))
| nil = sK6(X0)
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f416,f153]) ).
fof(f153,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f416,plain,
! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(X0),nil))
| nil = sK6(X0)
| ~ ssList(sK6(X0))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f414,f155]) ).
fof(f414,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(cons(X0,nil))
| nil = X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f412,f188]) ).
fof(f412,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(cons(X0,nil))
| ~ singletonP(cons(X0,nil))
| nil = X1
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f408]) ).
fof(f408,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(cons(X0,nil))
| ~ singletonP(cons(X0,nil))
| nil = X1
| ~ ssList(X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f406,f165]) ).
fof(f165,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,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.IqH3a8oRRZ/Vampire---4.8_24413',ax81) ).
fof(f406,plain,
! [X0,X1] :
( app(X0,X1) != sK3
| ~ ssList(X0)
| ~ singletonP(X0)
| nil = X1
| ~ ssList(X1) ),
inference(subsumption_resolution,[],[f405,f154]) ).
fof(f405,plain,
! [X0,X1] :
( ~ singletonP(X0)
| ~ ssList(X0)
| app(X0,X1) != sK3
| nil = X1
| ~ ssList(X1)
| ~ ssItem(sK7(X1)) ),
inference(subsumption_resolution,[],[f404,f175]) ).
fof(f404,plain,
! [X0,X1] :
( ~ singletonP(X0)
| ~ ssList(X0)
| app(X0,X1) != sK3
| nil = X1
| ~ ssList(X1)
| ~ ssItem(sK7(X1))
| ~ ssList(nil) ),
inference(resolution,[],[f392,f159]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssList(cons(sK7(X0),nil))
| ~ singletonP(X1)
| ~ ssList(X1)
| app(X1,X0) != sK3
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f391,f154]) ).
fof(f391,plain,
! [X0,X1] :
( app(X1,X0) != sK3
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f382,f153]) ).
fof(f382,plain,
! [X0,X1] :
( app(X1,X0) != sK3
| ~ ssList(sK6(X0))
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssList(cons(sK7(X0),nil))
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(superposition,[],[f288,f155]) ).
fof(f288,plain,
! [X2,X0,X1] :
( sK3 != app(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ singletonP(X2)
| ~ ssList(X2)
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(subsumption_resolution,[],[f286,f188]) ).
fof(f286,plain,
! [X2,X0,X1] :
( sK3 != app(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ singletonP(X2)
| ~ ssList(X2)
| ~ singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0) ),
inference(duplicate_literal_removal,[],[f277]) ).
fof(f277,plain,
! [X2,X0,X1] :
( sK3 != app(X2,cons(X0,X1))
| ~ ssList(X1)
| ~ singletonP(X2)
| ~ ssList(X2)
| ~ singletonP(cons(X0,nil))
| ~ ssList(cons(X0,nil))
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(superposition,[],[f269,f165]) ).
fof(f269,plain,
! [X2,X0,X1] :
( app(X0,app(X1,X2)) != sK3
| ~ ssList(X2)
| ~ singletonP(X0)
| ~ ssList(X0)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f267]) ).
fof(f267,plain,
! [X2,X0,X1] :
( app(X0,app(X1,X2)) != sK3
| ~ ssList(X2)
| ~ singletonP(X0)
| ~ ssList(X0)
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(superposition,[],[f206,f164]) ).
fof(f164,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f109]) ).
fof(f109,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IqH3a8oRRZ/Vampire---4.8_24413',ax82) ).
fof(f206,plain,
! [X2,X0,X1] :
( sK3 != app(app(X1,X0),X2)
| ~ ssList(X2)
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f200,f177]) ).
fof(f177,plain,
! [X0] :
( ssItem(sK8(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK8(X0),nil) = X0
& ssItem(sK8(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK8])],[f137,f138]) ).
fof(f138,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK8(X0),nil) = X0
& ssItem(sK8(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f137,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f120]) ).
fof(f120,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IqH3a8oRRZ/Vampire---4.8_24413',ax4) ).
fof(f200,plain,
! [X2,X0,X1] :
( sK3 != app(app(X1,X0),X2)
| ~ ssList(X2)
| ~ ssItem(sK8(X0))
| ~ singletonP(X1)
| ~ ssList(X1)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f197,f178]) ).
fof(f178,plain,
! [X0] :
( cons(sK8(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f197,plain,
! [X2,X0,X1] :
( sK3 != app(app(X0,cons(X1,nil)),X2)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f192,f177]) ).
fof(f192,plain,
! [X2,X0,X1] :
( sK3 != app(app(X0,cons(X1,nil)),X2)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(sK8(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(superposition,[],[f147,f178]) ).
fof(f147,plain,
! [X6,X4,X5] :
( app(app(cons(X4,nil),cons(X5,nil)),X6) != sK3
| ~ ssList(X6)
| ~ ssItem(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f125]) ).
fof(f155,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f131]) ).
fof(f188,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f179]) ).
fof(f179,plain,
! [X0,X1] :
( singletonP(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f181,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f146,f144]) ).
fof(f146,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC149+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.15 % 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.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 18:34:55 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.15/0.36 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.IqH3a8oRRZ/Vampire---4.8_24413
% 0.60/0.75 % (24600)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.60/0.75 % (24606)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.60/0.75 % (24601)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.60/0.75 % (24602)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.60/0.75 % (24599)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.60/0.75 % (24604)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.60/0.75 % (24603)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.60/0.75 % (24605)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.60/0.76 % (24604)First to succeed.
% 0.60/0.76 % (24606)Instruction limit reached!
% 0.60/0.76 % (24606)------------------------------
% 0.60/0.76 % (24606)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.76 % (24606)Termination reason: Unknown
% 0.60/0.76 % (24606)Termination phase: Saturation
% 0.60/0.76
% 0.60/0.76 % (24606)Memory used [KB]: 1520
% 0.60/0.76 % (24606)Time elapsed: 0.017 s
% 0.60/0.76 % (24606)Instructions burned: 58 (million)
% 0.60/0.76 % (24606)------------------------------
% 0.60/0.76 % (24606)------------------------------
% 0.61/0.77 % (24604)Refutation found. Thanks to Tanya!
% 0.61/0.77 % SZS status Theorem for Vampire---4
% 0.61/0.77 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.77 % (24604)------------------------------
% 0.61/0.77 % (24604)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (24604)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (24604)Memory used [KB]: 1234
% 0.61/0.77 % (24604)Time elapsed: 0.017 s
% 0.61/0.77 % (24604)Instructions burned: 29 (million)
% 0.61/0.77 % (24604)------------------------------
% 0.61/0.77 % (24604)------------------------------
% 0.61/0.77 % (24579)Success in time 0.388 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------