TSTP Solution File: SWC211+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC211+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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.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:38 EDT 2024
% Result : Theorem 0.48s 0.71s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 16
% Syntax : Number of formulae : 87 ( 14 unt; 0 def)
% Number of atoms : 464 ( 196 equ)
% Maximal formula atoms : 28 ( 5 avg)
% Number of connectives : 613 ( 236 ~; 231 |; 116 &)
% ( 5 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 146 ( 108 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f470,plain,
$false,
inference(avatar_sat_refutation,[],[f205,f469]) ).
fof(f469,plain,
~ spl8_1,
inference(avatar_contradiction_clause,[],[f468]) ).
fof(f468,plain,
( $false
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f465,f138]) ).
fof(f138,plain,
ssList(sK3),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
( ( nil != sK3
| nil = sK2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK3
| app(X5,cons(X4,nil)) = sK2
| ~ ssList(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,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil)
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ( nil != X3
| nil = sK2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = sK2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK3
| nil = sK2 )
& ~ neq(sK0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != sK3
| app(X5,cons(X4,nil)) = sK2
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil)
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(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] :
( ( nil != X3
| nil = X2 )
& ~ neq(X0,nil)
& ! [X4] :
( ! [X5] :
( app(cons(X4,nil),X5) != X3
| app(X5,cons(X4,nil)) = X2
| ~ ssList(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)
=> ( ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2
& ssList(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)
=> ( ( nil = X3
& nil != X2 )
| neq(X0,nil)
| ? [X4] :
( ? [X5] :
( app(cons(X4,nil),X5) = X3
& app(X5,cons(X4,nil)) != X2
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',co1) ).
fof(f465,plain,
( ~ ssList(sK3)
| ~ spl8_1 ),
inference(trivial_inequality_removal,[],[f464]) ).
fof(f464,plain,
( sK3 != sK3
| ~ ssList(sK3)
| ~ spl8_1 ),
inference(duplicate_literal_removal,[],[f463]) ).
fof(f463,plain,
( sK3 != sK3
| ~ ssList(sK3)
| ~ ssList(sK3)
| ~ spl8_1 ),
inference(resolution,[],[f440,f181]) ).
fof(f181,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f178]) ).
fof(f178,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f167]) ).
fof(f167,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f133,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/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax15) ).
fof(f440,plain,
( ! [X0] :
( neq(sK3,X0)
| sK3 != X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(superposition,[],[f173,f432]) ).
fof(f432,plain,
( ! [X0] :
( nil = X0
| sK3 != X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f421,f150]) ).
fof(f150,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,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,f129,f128]) ).
fof(f128,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(f129,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/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax20) ).
fof(f421,plain,
( ! [X0] :
( nil = X0
| sK3 != X0
| ~ ssItem(sK7(X0))
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(duplicate_literal_removal,[],[f409]) ).
fof(f409,plain,
( ! [X0] :
( nil = X0
| sK3 != X0
| ~ ssItem(sK7(X0))
| ~ ssList(X0)
| nil = X0
| ~ ssList(X0)
| sK3 != X0 )
| ~ spl8_1 ),
inference(superposition,[],[f308,f396]) ).
fof(f396,plain,
( ! [X0] :
( cons(sK7(X0),nil) = X0
| nil = X0
| ~ ssList(X0)
| sK3 != X0 )
| ~ spl8_1 ),
inference(duplicate_literal_removal,[],[f395]) ).
fof(f395,plain,
( ! [X0] :
( cons(sK7(X0),nil) = X0
| nil = X0
| ~ ssList(X0)
| sK3 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(superposition,[],[f151,f384]) ).
fof(f384,plain,
( ! [X0] :
( nil = sK6(X0)
| sK3 != X0
| nil = X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f383,f150]) ).
fof(f383,plain,
( ! [X0] :
( sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssItem(sK7(X0)) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f381,f171]) ).
fof(f171,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax17) ).
fof(f381,plain,
( ! [X0] :
( sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0)
| ~ ssItem(sK7(X0))
| ~ ssList(nil) )
| ~ spl8_1 ),
inference(resolution,[],[f379,f155]) ).
fof(f155,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/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax16) ).
fof(f379,plain,
( ! [X0] :
( ~ ssList(cons(sK7(X0),nil))
| sK3 != X0
| nil = sK6(X0)
| nil = X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f378,f150]) ).
fof(f378,plain,
( ! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(X0),nil))
| nil = sK6(X0)
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f372,f149]) ).
fof(f149,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f372,plain,
( ! [X0] :
( sK3 != X0
| ~ ssList(cons(sK7(X0),nil))
| ~ ssList(sK6(X0))
| nil = sK6(X0)
| ~ ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) )
| ~ spl8_1 ),
inference(superposition,[],[f370,f151]) ).
fof(f370,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| nil = X1
| ~ ssItem(X0) )
| ~ spl8_1 ),
inference(duplicate_literal_removal,[],[f364]) ).
fof(f364,plain,
( ! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssList(cons(X0,nil))
| ~ ssList(X1)
| nil = X1
| ~ ssItem(X0)
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl8_1 ),
inference(superposition,[],[f246,f161]) ).
fof(f161,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/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax81) ).
fof(f246,plain,
( ! [X0,X1] :
( app(cons(X1,nil),X0) != sK3
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| nil = X0
| ~ ssItem(X1) )
| ~ spl8_1 ),
inference(subsumption_resolution,[],[f237,f186]) ).
fof(f186,plain,
( nil = sK2
| ~ spl8_1 ),
inference(avatar_component_clause,[],[f184]) ).
fof(f184,plain,
( spl8_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_1])]) ).
fof(f237,plain,
! [X0,X1] :
( nil != sK2
| nil = X0
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK3
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f218]) ).
fof(f218,plain,
! [X0,X1] :
( nil != sK2
| nil = X0
| ~ ssList(cons(X1,nil))
| ~ ssList(X0)
| app(cons(X1,nil),X0) != sK3
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(superposition,[],[f158,f142]) ).
fof(f142,plain,
! [X4,X5] :
( app(X5,cons(X4,nil)) = sK2
| app(cons(X4,nil),X5) != sK3
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f158,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f132,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,[],[f131]) ).
fof(f131,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,[],[f108]) ).
fof(f108,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.m6rnp0yyDe/Vampire---4.8_9007',ax83) ).
fof(f151,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f308,plain,
( ! [X0] :
( nil = cons(X0,nil)
| cons(X0,nil) != sK3
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) )
| ~ spl8_1 ),
inference(duplicate_literal_removal,[],[f305]) ).
fof(f305,plain,
( ! [X0] :
( cons(X0,nil) != sK3
| nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil))
| ~ ssList(cons(X0,nil)) )
| ~ spl8_1 ),
inference(superposition,[],[f240,f156]) ).
fof(f156,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax84) ).
fof(f240,plain,
( ! [X0] :
( sK3 != app(cons(X0,nil),nil)
| nil = cons(X0,nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) )
| ~ spl8_1 ),
inference(forward_demodulation,[],[f239,f186]) ).
fof(f239,plain,
! [X0] :
( cons(X0,nil) = sK2
| sK3 != app(cons(X0,nil),nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(subsumption_resolution,[],[f212,f171]) ).
fof(f212,plain,
! [X0] :
( cons(X0,nil) = sK2
| sK3 != app(cons(X0,nil),nil)
| ~ ssList(nil)
| ~ ssItem(X0)
| ~ ssList(cons(X0,nil)) ),
inference(superposition,[],[f142,f164]) ).
fof(f164,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,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/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007',ax28) ).
fof(f173,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f141,f139]) ).
fof(f139,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f124]) ).
fof(f141,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f124]) ).
fof(f205,plain,
spl8_1,
inference(avatar_split_clause,[],[f204,f184]) ).
fof(f204,plain,
nil = sK2,
inference(subsumption_resolution,[],[f203,f137]) ).
fof(f137,plain,
ssList(sK2),
inference(cnf_transformation,[],[f124]) ).
fof(f203,plain,
( nil = sK2
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f193,f171]) ).
fof(f193,plain,
( nil = sK2
| ~ ssList(nil)
| ~ ssList(sK2) ),
inference(resolution,[],[f172,f168]) ).
fof(f168,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f172,plain,
~ neq(sK2,nil),
inference(definition_unfolding,[],[f143,f140]) ).
fof(f140,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f124]) ).
fof(f143,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC211+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Tue Apr 30 18:15:17 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.36 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.m6rnp0yyDe/Vampire---4.8_9007
% 0.48/0.69 % (9265)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.48/0.69 % (9261)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.48/0.69 % (9259)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.48/0.69 % (9262)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.48/0.69 % (9260)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.48/0.69 % (9263)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.48/0.69 % (9266)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.48/0.70 % (9264)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.48/0.71 % (9263)Instruction limit reached!
% 0.48/0.71 % (9263)------------------------------
% 0.48/0.71 % (9263)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.71 % (9263)Termination reason: Unknown
% 0.48/0.71 % (9263)Termination phase: Saturation
% 0.48/0.71
% 0.48/0.71 % (9263)Memory used [KB]: 1991
% 0.48/0.71 % (9263)Time elapsed: 0.020 s
% 0.48/0.71 % (9263)Instructions burned: 34 (million)
% 0.48/0.71 % (9263)------------------------------
% 0.48/0.71 % (9263)------------------------------
% 0.48/0.71 % (9259)Instruction limit reached!
% 0.48/0.71 % (9259)------------------------------
% 0.48/0.71 % (9259)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.71 % (9259)Termination reason: Unknown
% 0.48/0.71 % (9259)Termination phase: Saturation
% 0.48/0.71
% 0.48/0.71 % (9259)Memory used [KB]: 1339
% 0.48/0.71 % (9259)Time elapsed: 0.021 s
% 0.48/0.71 % (9259)Instructions burned: 34 (million)
% 0.48/0.71 % (9259)------------------------------
% 0.48/0.71 % (9259)------------------------------
% 0.48/0.71 % (9265)Instruction limit reached!
% 0.48/0.71 % (9265)------------------------------
% 0.48/0.71 % (9265)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.71 % (9265)Termination reason: Unknown
% 0.48/0.71 % (9265)Termination phase: Saturation
% 0.48/0.71
% 0.48/0.71 % (9265)Memory used [KB]: 2033
% 0.48/0.71 % (9265)Time elapsed: 0.022 s
% 0.48/0.71 % (9265)Instructions burned: 86 (million)
% 0.48/0.71 % (9265)------------------------------
% 0.48/0.71 % (9265)------------------------------
% 0.48/0.71 % (9264)First to succeed.
% 0.48/0.71 % (9262)Instruction limit reached!
% 0.48/0.71 % (9262)------------------------------
% 0.48/0.71 % (9262)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.71 % (9262)Termination reason: Unknown
% 0.48/0.71 % (9262)Termination phase: Saturation
% 0.48/0.71
% 0.48/0.71 % (9262)Memory used [KB]: 1771
% 0.48/0.71 % (9262)Time elapsed: 0.021 s
% 0.48/0.71 % (9262)Instructions burned: 35 (million)
% 0.48/0.71 % (9262)------------------------------
% 0.48/0.71 % (9262)------------------------------
% 0.48/0.71 % (9267)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.48/0.71 % (9260)Also succeeded, but the first one will report.
% 0.48/0.71 % (9264)Refutation found. Thanks to Tanya!
% 0.48/0.71 % SZS status Theorem for Vampire---4
% 0.48/0.71 % SZS output start Proof for Vampire---4
% See solution above
% 0.48/0.71 % (9264)------------------------------
% 0.48/0.71 % (9264)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.48/0.71 % (9264)Termination reason: Refutation
% 0.48/0.71
% 0.48/0.71 % (9264)Memory used [KB]: 1222
% 0.48/0.71 % (9264)Time elapsed: 0.035 s
% 0.48/0.71 % (9264)Instructions burned: 21 (million)
% 0.48/0.71 % (9264)------------------------------
% 0.48/0.71 % (9264)------------------------------
% 0.48/0.71 % (9255)Success in time 0.352 s
% 0.62/0.71 % Vampire---4.8 exiting
%------------------------------------------------------------------------------