TSTP Solution File: SWC029+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC029+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 : n022.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 03:59:17 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 88 ( 6 unt; 0 def)
% Number of atoms : 469 ( 204 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 577 ( 196 ~; 191 |; 154 &)
% ( 12 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 86 ( 38 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f333,plain,
$false,
inference(avatar_sat_refutation,[],[f200,f201,f210,f215,f220,f225,f226,f243,f285,f332]) ).
fof(f332,plain,
( ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5
| ~ spl10_6
| ~ spl10_10 ),
inference(avatar_contradiction_clause,[],[f331]) ).
fof(f331,plain,
( $false
| ~ spl10_1
| spl10_2
| ~ spl10_3
| ~ spl10_5
| ~ spl10_6
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f330,f199]) ).
fof(f199,plain,
( nil != sK3
| spl10_2 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f197,plain,
( spl10_2
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f330,plain,
( nil = sK3
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5
| ~ spl10_6
| ~ spl10_10 ),
inference(forward_demodulation,[],[f329,f328]) ).
fof(f328,plain,
( nil = app(nil,nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_6
| ~ spl10_10 ),
inference(forward_demodulation,[],[f325,f298]) ).
fof(f298,plain,
( nil = cons(sK4,nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_6
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f297,f219]) ).
fof(f219,plain,
( ssList(sK5)
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f217]) ).
fof(f217,plain,
( spl10_6
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f297,plain,
( nil = cons(sK4,nil)
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f296,f257]) ).
fof(f257,plain,
( ssList(cons(sK4,nil))
| ~ spl10_10 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f256,plain,
( spl10_10
<=> ssList(cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_10])]) ).
fof(f296,plain,
( nil = cons(sK4,nil)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3 ),
inference(trivial_inequality_removal,[],[f286]) ).
fof(f286,plain,
( nil != nil
| nil = cons(sK4,nil)
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3 ),
inference(superposition,[],[f164,f244]) ).
fof(f244,plain,
( nil = app(sK5,cons(sK4,nil))
| ~ spl10_1
| ~ spl10_3 ),
inference(forward_demodulation,[],[f205,f194]) ).
fof(f194,plain,
( nil = sK2
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f193]) ).
fof(f193,plain,
( spl10_1
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f205,plain,
( sK2 = app(sK5,cons(sK4,nil))
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f203,plain,
( spl10_3
<=> sK2 = app(sK5,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f164,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,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,[],[f133]) ).
fof(f133,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.lIJ6K5HylP/Vampire---4.8_20077',ax83) ).
fof(f325,plain,
( nil = app(nil,cons(sK4,nil))
| ~ spl10_1
| ~ spl10_3
| ~ spl10_6
| ~ spl10_10 ),
inference(superposition,[],[f244,f300]) ).
fof(f300,plain,
( nil = sK5
| ~ spl10_1
| ~ spl10_3
| ~ spl10_6
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f299,f219]) ).
fof(f299,plain,
( nil = sK5
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_10 ),
inference(subsumption_resolution,[],[f295,f257]) ).
fof(f295,plain,
( nil = sK5
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3 ),
inference(trivial_inequality_removal,[],[f287]) ).
fof(f287,plain,
( nil != nil
| nil = sK5
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3 ),
inference(superposition,[],[f165,f244]) ).
fof(f165,plain,
! [X0,X1] :
( nil != app(X0,X1)
| nil = X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f329,plain,
( sK3 = app(nil,nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5
| ~ spl10_6
| ~ spl10_10 ),
inference(forward_demodulation,[],[f326,f298]) ).
fof(f326,plain,
( sK3 = app(cons(sK4,nil),nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_5
| ~ spl10_6
| ~ spl10_10 ),
inference(superposition,[],[f214,f300]) ).
fof(f214,plain,
( sK3 = app(cons(sK4,nil),sK5)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f212,plain,
( spl10_5
<=> sK3 = app(cons(sK4,nil),sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f285,plain,
( ~ spl10_7
| spl10_10 ),
inference(avatar_contradiction_clause,[],[f284]) ).
fof(f284,plain,
( $false
| ~ spl10_7
| spl10_10 ),
inference(subsumption_resolution,[],[f283,f178]) ).
fof(f178,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.lIJ6K5HylP/Vampire---4.8_20077',ax17) ).
fof(f283,plain,
( ~ ssList(nil)
| ~ spl10_7
| spl10_10 ),
inference(subsumption_resolution,[],[f282,f224]) ).
fof(f224,plain,
( ssItem(sK4)
| ~ spl10_7 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl10_7
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f282,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| spl10_10 ),
inference(resolution,[],[f258,f162]) ).
fof(f162,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.lIJ6K5HylP/Vampire---4.8_20077',ax16) ).
fof(f258,plain,
( ~ ssList(cons(sK4,nil))
| spl10_10 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f243,plain,
( spl10_2
| spl10_4 ),
inference(avatar_contradiction_clause,[],[f242]) ).
fof(f242,plain,
( $false
| spl10_2
| spl10_4 ),
inference(subsumption_resolution,[],[f241,f140]) ).
fof(f140,plain,
ssList(sK3),
inference(cnf_transformation,[],[f126]) ).
fof(f126,plain,
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( sK2 = app(sK5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),sK5)
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f99,f125,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = sK0 )
| ( nil != sK0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ( nil != sK1
& nil = sK0 )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = sK3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK2
& app(cons(X4,nil),X5) = sK3
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK2 = app(X5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),X5)
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X5] :
( sK2 = app(X5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),X5)
& ssList(X5) )
=> ( sK2 = app(sK5,cons(sK4,nil))
& sK3 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( nil != X1
& nil = X0 )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X2
& app(cons(X4,nil),X5) = X3
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& 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 = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3 ) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil = X1
| nil != X0 )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X2
| app(cons(X4,nil),X5) != X3 ) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.lIJ6K5HylP/Vampire---4.8_20077',co1) ).
fof(f241,plain,
( ~ ssList(sK3)
| spl10_2
| spl10_4 ),
inference(subsumption_resolution,[],[f240,f178]) ).
fof(f240,plain,
( ~ ssList(nil)
| ~ ssList(sK3)
| spl10_2
| spl10_4 ),
inference(subsumption_resolution,[],[f229,f199]) ).
fof(f229,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl10_4 ),
inference(resolution,[],[f209,f175]) ).
fof(f175,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,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.lIJ6K5HylP/Vampire---4.8_20077',ax15) ).
fof(f209,plain,
( ~ neq(sK3,nil)
| spl10_4 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f207,plain,
( spl10_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f226,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f143,f197,f193]) ).
fof(f143,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f126]) ).
fof(f225,plain,
( spl10_7
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f144,f207,f222]) ).
fof(f144,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f126]) ).
fof(f220,plain,
( spl10_6
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f145,f207,f217]) ).
fof(f145,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f126]) ).
fof(f215,plain,
( spl10_5
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f146,f207,f212]) ).
fof(f146,plain,
( ~ neq(sK3,nil)
| sK3 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f126]) ).
fof(f210,plain,
( spl10_3
| ~ spl10_4 ),
inference(avatar_split_clause,[],[f147,f207,f203]) ).
fof(f147,plain,
( ~ neq(sK3,nil)
| sK2 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f126]) ).
fof(f201,plain,
( spl10_2
| spl10_1 ),
inference(avatar_split_clause,[],[f182,f193,f197]) ).
fof(f182,plain,
( nil = sK2
| nil = sK3 ),
inference(definition_unfolding,[],[f148,f142,f141]) ).
fof(f141,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f126]) ).
fof(f142,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f126]) ).
fof(f148,plain,
( nil = sK0
| nil = sK1 ),
inference(cnf_transformation,[],[f126]) ).
fof(f200,plain,
( ~ spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f179,f197,f193]) ).
fof(f179,plain,
( nil != sK3
| nil != sK2 ),
inference(definition_unfolding,[],[f151,f141,f142]) ).
fof(f151,plain,
( nil != sK1
| nil != sK0 ),
inference(cnf_transformation,[],[f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWC029+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/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 : n022.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.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 300
% 0.16/0.37 % DateTime : Tue Apr 30 18:17:13 EDT 2024
% 0.16/0.37 % CPUTime :
% 0.16/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.16/0.37 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.lIJ6K5HylP/Vampire---4.8_20077
% 0.56/0.76 % (20335)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.56/0.76 % (20329)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.56/0.76 % (20330)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.56/0.76 % (20334)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.56/0.76 % (20332)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.61/0.76 % (20336)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.61/0.76 % (20331)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.61/0.76 % (20334)First to succeed.
% 0.61/0.77 % (20331)Also succeeded, but the first one will report.
% 0.61/0.77 % (20333)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.61/0.77 % (20334)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 % (20334)------------------------------
% 0.61/0.77 % (20334)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (20334)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (20334)Memory used [KB]: 1188
% 0.61/0.77 % (20334)Time elapsed: 0.008 s
% 0.61/0.77 % (20334)Instructions burned: 11 (million)
% 0.61/0.77 % (20334)------------------------------
% 0.61/0.77 % (20334)------------------------------
% 0.61/0.77 % (20325)Success in time 0.386 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------