TSTP Solution File: SWC325+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC325+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 : n009.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:01:26 EDT 2024
% Result : Theorem 0.62s 0.78s
% Output : Refutation 0.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 19
% Syntax : Number of formulae : 78 ( 9 unt; 0 def)
% Number of atoms : 410 ( 166 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 517 ( 185 ~; 158 |; 135 &)
% ( 9 <=>; 30 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 121 ( 67 !; 54 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f345,plain,
$false,
inference(avatar_sat_refutation,[],[f195,f200,f205,f210,f219,f262,f288,f344]) ).
fof(f344,plain,
( ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(avatar_contradiction_clause,[],[f343]) ).
fof(f343,plain,
( $false
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f342,f176]) ).
fof(f176,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.LUwuxed2fN/Vampire---4.8_10582',ax17) ).
fof(f342,plain,
( ~ ssList(nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4
| ~ spl10_5 ),
inference(subsumption_resolution,[],[f341,f209]) ).
fof(f209,plain,
( ssItem(sK4)
| ~ spl10_5 ),
inference(avatar_component_clause,[],[f207]) ).
fof(f207,plain,
( spl10_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_5])]) ).
fof(f341,plain,
( ~ ssItem(sK4)
| ~ ssList(nil)
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4 ),
inference(resolution,[],[f340,f160]) ).
fof(f160,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f107]) ).
fof(f107,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.LUwuxed2fN/Vampire---4.8_10582',ax16) ).
fof(f340,plain,
( ~ ssList(cons(sK4,nil))
| ~ spl10_1
| ~ spl10_3
| ~ spl10_4 ),
inference(subsumption_resolution,[],[f339,f204]) ).
fof(f204,plain,
( ssList(sK5)
| ~ spl10_4 ),
inference(avatar_component_clause,[],[f202]) ).
fof(f202,plain,
( spl10_4
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_4])]) ).
fof(f339,plain,
( ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_1
| ~ spl10_3 ),
inference(subsumption_resolution,[],[f337,f190]) ).
fof(f190,plain,
( sK3 = app(sK5,cons(sK4,nil))
| ~ spl10_1 ),
inference(avatar_component_clause,[],[f188]) ).
fof(f188,plain,
( spl10_1
<=> sK3 = app(sK5,cons(sK4,nil)) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_1])]) ).
fof(f337,plain,
( sK3 != app(sK5,cons(sK4,nil))
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_3 ),
inference(trivial_inequality_removal,[],[f331]) ).
fof(f331,plain,
( sK2 != sK2
| sK3 != app(sK5,cons(sK4,nil))
| ~ ssList(cons(sK4,nil))
| ~ ssList(sK5)
| ~ spl10_3 ),
inference(superposition,[],[f177,f199]) ).
fof(f199,plain,
( sK2 = app(cons(sK4,nil),sK5)
| ~ spl10_3 ),
inference(avatar_component_clause,[],[f197]) ).
fof(f197,plain,
( spl10_3
<=> sK2 = app(cons(sK4,nil),sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_3])]) ).
fof(f177,plain,
! [X6,X7] :
( app(X7,X6) != sK2
| app(X6,X7) != sK3
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(definition_unfolding,[],[f144,f143,f142]) ).
fof(f142,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ( ~ neq(sK3,nil)
| ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5)
& ssItem(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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])],[f100,f126,f125,f124,f123,f122,f121]) ).
fof(f121,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( ~ neq(sK3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7) )
| ~ ssList(X6) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = sK3
& app(cons(X4,nil),X5) = sK2
& ssList(X5) )
& ssItem(X4) )
=> ( ? [X5] :
( sK3 = app(X5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X5)
& ssList(X5) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X5] :
( sK3 = app(X5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),X5)
& ssList(X5) )
=> ( sK3 = app(sK5,cons(sK4,nil))
& sK2 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ? [X5] :
( app(X5,cons(X4,nil)) = X3
& app(cons(X4,nil),X5) = X2
& ssList(X5) )
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ! [X7] :
( app(X7,X6) != X0
| app(X6,X7) != X1
| ~ ssList(X7) )
| ~ ssList(X6) )
& 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)
=> ( ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(X5,cons(X4,nil)) != X3
| app(cons(X4,nil),X5) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X6] :
( ? [X7] :
( app(X7,X6) = X0
& app(X6,X7) = X1
& ssList(X7) )
& ssList(X6) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ssList(X7)
=> ( app(X7,cons(X6,nil)) != X3
| app(cons(X6,nil),X7) != X2 ) ) ) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( ? [X5] :
( app(X5,X4) = X0
& app(X4,X5) = X1
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.LUwuxed2fN/Vampire---4.8_10582',co1) ).
fof(f143,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f127]) ).
fof(f144,plain,
! [X6,X7] :
( app(X7,X6) != sK0
| app(X6,X7) != sK1
| ~ ssList(X7)
| ~ ssList(X6) ),
inference(cnf_transformation,[],[f127]) ).
fof(f288,plain,
( ~ spl10_7
| ~ spl10_6 ),
inference(avatar_split_clause,[],[f287,f212,f216]) ).
fof(f216,plain,
( spl10_7
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_7])]) ).
fof(f212,plain,
( spl10_6
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl10_6])]) ).
fof(f287,plain,
( nil != sK3
| ~ spl10_6 ),
inference(forward_demodulation,[],[f232,f214]) ).
fof(f214,plain,
( nil = sK2
| ~ spl10_6 ),
inference(avatar_component_clause,[],[f212]) ).
fof(f232,plain,
sK2 != sK3,
inference(subsumption_resolution,[],[f231,f140]) ).
fof(f140,plain,
ssList(sK2),
inference(cnf_transformation,[],[f127]) ).
fof(f231,plain,
( sK2 != sK3
| ~ ssList(sK2) ),
inference(trivial_inequality_removal,[],[f228]) ).
fof(f228,plain,
( sK2 != sK3
| sK2 != sK2
| ~ ssList(sK2) ),
inference(superposition,[],[f222,f225]) ).
fof(f225,plain,
sK2 = app(nil,sK2),
inference(resolution,[],[f169,f140]) ).
fof(f169,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,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/sandbox2/tmp/tmp.LUwuxed2fN/Vampire---4.8_10582',ax28) ).
fof(f222,plain,
! [X0] :
( app(nil,X0) != sK3
| sK2 != X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f221,f176]) ).
fof(f221,plain,
! [X0] :
( sK2 != X0
| app(nil,X0) != sK3
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(duplicate_literal_removal,[],[f220]) ).
fof(f220,plain,
! [X0] :
( sK2 != X0
| app(nil,X0) != sK3
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(X0) ),
inference(superposition,[],[f177,f161]) ).
fof(f161,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f108]) ).
fof(f108,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/sandbox2/tmp/tmp.LUwuxed2fN/Vampire---4.8_10582',ax84) ).
fof(f262,plain,
( spl10_7
| spl10_2 ),
inference(avatar_split_clause,[],[f261,f192,f216]) ).
fof(f192,plain,
( spl10_2
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl10_2])]) ).
fof(f261,plain,
( nil = sK3
| spl10_2 ),
inference(subsumption_resolution,[],[f260,f141]) ).
fof(f141,plain,
ssList(sK3),
inference(cnf_transformation,[],[f127]) ).
fof(f260,plain,
( nil = sK3
| ~ ssList(sK3)
| spl10_2 ),
inference(subsumption_resolution,[],[f251,f176]) ).
fof(f251,plain,
( nil = sK3
| ~ ssList(nil)
| ~ ssList(sK3)
| spl10_2 ),
inference(resolution,[],[f173,f194]) ).
fof(f194,plain,
( ~ neq(sK3,nil)
| spl10_2 ),
inference(avatar_component_clause,[],[f192]) ).
fof(f173,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,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.LUwuxed2fN/Vampire---4.8_10582',ax15) ).
fof(f219,plain,
( spl10_6
| ~ spl10_7 ),
inference(avatar_split_clause,[],[f145,f216,f212]) ).
fof(f145,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f127]) ).
fof(f210,plain,
( spl10_5
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f146,f192,f207]) ).
fof(f146,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f127]) ).
fof(f205,plain,
( spl10_4
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f147,f192,f202]) ).
fof(f147,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f200,plain,
( spl10_3
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f148,f192,f197]) ).
fof(f148,plain,
( ~ neq(sK3,nil)
| sK2 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f195,plain,
( spl10_1
| ~ spl10_2 ),
inference(avatar_split_clause,[],[f149,f192,f188]) ).
fof(f149,plain,
( ~ neq(sK3,nil)
| sK3 = app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f127]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC325+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.14 % 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.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Apr 30 18:14:11 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 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.LUwuxed2fN/Vampire---4.8_10582
% 0.62/0.76 % (10781)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.62/0.77 % (10782)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.62/0.77 % (10775)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.62/0.77 % (10777)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.62/0.77 % (10778)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.62/0.77 % (10776)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.62/0.77 % (10780)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.62/0.77 % (10779)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.62/0.78 % (10777)First to succeed.
% 0.62/0.78 % (10780)Also succeeded, but the first one will report.
% 0.62/0.78 % (10777)Refutation found. Thanks to Tanya!
% 0.62/0.78 % SZS status Theorem for Vampire---4
% 0.62/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.78 % (10777)------------------------------
% 0.62/0.78 % (10777)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.78 % (10777)Termination reason: Refutation
% 0.62/0.78
% 0.62/0.78 % (10777)Memory used [KB]: 1179
% 0.62/0.78 % (10777)Time elapsed: 0.015 s
% 0.62/0.78 % (10777)Instructions burned: 13 (million)
% 0.62/0.78 % (10777)------------------------------
% 0.62/0.78 % (10777)------------------------------
% 0.62/0.78 % (10748)Success in time 0.408 s
% 0.62/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------