TSTP Solution File: SWC320+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC320+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:01:24 EDT 2024
% Result : Theorem 0.61s 0.77s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 17
% Syntax : Number of formulae : 66 ( 3 unt; 1 typ; 0 def)
% Number of atoms : 982 ( 161 equ)
% Maximal formula atoms : 40 ( 15 avg)
% Number of connectives : 541 ( 193 ~; 175 |; 146 &)
% ( 9 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 569 ( 569 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 16 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 113 ( 64 !; 48 ?; 25 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_20,type,
sQ10_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f287,plain,
$false,
inference(avatar_sat_refutation,[],[f229,f234,f239,f240,f245,f250,f255,f260,f261,f285]) ).
tff(f285,plain,
( ~ spl11_2
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(avatar_contradiction_clause,[],[f284]) ).
tff(f284,plain,
( $false
| ~ spl11_2
| ~ spl11_5
| ~ spl11_6
| ~ spl11_7
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f283,f254]) ).
tff(f254,plain,
( ssList(sK5)
| ~ spl11_7 ),
inference(avatar_component_clause,[],[f252]) ).
tff(f252,plain,
( spl11_7
<=> ssList(sK5) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_7])]) ).
tff(f283,plain,
( ~ ssList(sK5)
| ~ spl11_2
| ~ spl11_5
| ~ spl11_6
| ~ spl11_8 ),
inference(subsumption_resolution,[],[f282,f259]) ).
tff(f259,plain,
( ssItem(sK4)
| ~ spl11_8 ),
inference(avatar_component_clause,[],[f257]) ).
tff(f257,plain,
( spl11_8
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_8])]) ).
tff(f282,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ spl11_2
| ~ spl11_5
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f280,f249]) ).
tff(f249,plain,
( sQ10_eqProxy($i,sK2,app(cons(sK4,nil),sK5))
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f247]) ).
tff(f247,plain,
( spl11_6
<=> sQ10_eqProxy($i,sK2,app(cons(sK4,nil),sK5)) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
tff(f280,plain,
( ~ sQ10_eqProxy($i,sK2,app(cons(sK4,nil),sK5))
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ spl11_2
| ~ spl11_5 ),
inference(resolution,[],[f278,f244]) ).
tff(f244,plain,
( sQ10_eqProxy($i,sK3,app(sK5,cons(sK4,nil)))
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f242]) ).
tff(f242,plain,
( spl11_5
<=> sQ10_eqProxy($i,sK3,app(sK5,cons(sK4,nil))) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
tff(f278,plain,
( ! [X0: $i,X1: $i] :
( ~ sQ10_eqProxy($i,sK3,app(X1,cons(X0,nil)))
| ~ sQ10_eqProxy($i,sK2,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssList(X1) )
| ~ spl11_2 ),
inference(forward_literal_rewriting,[],[f274,f218]) ).
tff(f218,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ10_eqProxy(X0,X2,X1)
| ~ sQ10_eqProxy(X0,X1,X2) ),
inference(equality_proxy_axiom,[],[f189]) ).
tff(f189,plain,
! [X0: $tType,X2: X0,X1: X0] :
( sQ10_eqProxy(X0,X1,X2)
<=> ( X1 = X2 ) ),
introduced(equality_proxy_definition,[new_symbols(naming,[sQ10_eqProxy])]) ).
tff(f274,plain,
( ! [X0: $i,X1: $i] :
( ~ sQ10_eqProxy($i,sK2,app(cons(X0,nil),X1))
| ~ ssItem(X0)
| ~ ssList(X1)
| ~ sQ10_eqProxy($i,app(X1,cons(X0,nil)),sK3) )
| ~ spl11_2 ),
inference(resolution,[],[f218,f228]) ).
tff(f228,plain,
( ! [X4: $i,X5: $i] :
( ~ sQ10_eqProxy($i,app(cons(X4,nil),X5),sK2)
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ sQ10_eqProxy($i,app(X5,cons(X4,nil)),sK3) )
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f227]) ).
tff(f227,plain,
( spl11_2
<=> ! [X4,X5] :
( ~ sQ10_eqProxy($i,app(X5,cons(X4,nil)),sK3)
| ~ ssItem(X4)
| ~ ssList(X5)
| ~ sQ10_eqProxy($i,app(cons(X4,nil),X5),sK2) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
tff(f261,plain,
( spl11_1
| ~ spl11_3 ),
inference(avatar_split_clause,[],[f196,f231,f223]) ).
tff(f223,plain,
( spl11_1
<=> sQ10_eqProxy($i,nil,sK2) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_1])]) ).
tff(f231,plain,
( spl11_3
<=> sQ10_eqProxy($i,nil,sK3) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_3])]) ).
tff(f196,plain,
( ~ sQ10_eqProxy($i,nil,sK3)
| sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f143,f189]) ).
tff(f143,plain,
( ( nil != sK3 )
| ( nil = sK2 ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f126,plain,
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(sK3,nil)
| ( ( sK3 = app(sK5,cons(sK4,nil)) )
& ( sK2 = 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]) ).
tff(f120,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != X1 )
| ( app(cons(X4,nil),X5) != X0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( ( nil != X0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != X1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( ( nil != sK0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f121,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != X1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( ( nil != sK0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f122,plain,
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( sK0 = X2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = sK2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f123,plain,
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = sK2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = X3 )
& ssList(X3) )
=> ( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(sK1,nil) )
| ( ( nil != sK0 )
& ( nil = sK1 ) ) )
& ( ~ neq(sK3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = sK3 )
& ( app(cons(X6,nil),X7) = sK2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != sK3 )
| ( nil = sK2 ) )
& ( sK0 = sK2 )
& ( sK1 = sK3 )
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f124,plain,
( ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = sK3 )
& ( app(cons(X6,nil),X7) = sK2 )
& ssList(X7) )
& ssItem(X6) )
=> ( ? [X7] :
( ( sK3 = app(X7,cons(sK4,nil)) )
& ( sK2 = app(cons(sK4,nil),X7) )
& ssList(X7) )
& ssItem(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f125,plain,
( ? [X7] :
( ( sK3 = app(X7,cons(sK4,nil)) )
& ( sK2 = app(cons(sK4,nil),X7) )
& ssList(X7) )
=> ( ( sK3 = app(sK5,cons(sK4,nil)) )
& ( sK2 = app(cons(sK4,nil),sK5) )
& ssList(sK5) ) ),
introduced(choice_axiom,[]) ).
tff(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( ( ! [X4] :
( ! [X5] :
( ( app(X5,cons(X4,nil)) != X1 )
| ( app(cons(X4,nil),X5) != X0 )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& neq(X1,nil) )
| ( ( nil != X0 )
& ( nil = X1 ) ) )
& ( ~ neq(X3,nil)
| ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X3 )
& ( app(cons(X6,nil),X7) = X2 )
& ssList(X7) )
& ssItem(X6) ) )
& ( ( nil != X3 )
| ( nil = X2 ) )
& ( X0 = X2 )
& ( X1 = X3 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
tff(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X4] :
( ? [X5] :
( ( app(X5,cons(X4,nil)) = X1 )
& ( app(cons(X4,nil),X5) = X0 )
& ssList(X5) )
& ssItem(X4) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( ( app(X7,cons(X6,nil)) != X3 )
| ( app(cons(X6,nil),X7) != X2 )
| ~ ssList(X7) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
tff(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X1 )
& ( app(cons(X6,nil),X7) = X0 )
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ( app(X5,cons(X4,nil)) != X3 )
| ( app(cons(X4,nil),X5) != X2 )
| ~ ssList(X5) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
tff(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X6] :
( ? [X7] :
( ( app(X7,cons(X6,nil)) = X1 )
& ( app(cons(X6,nil),X7) = X0 )
& ssList(X7) )
& ssItem(X6) )
| ~ neq(X1,nil) )
& ( ( nil = X0 )
| ( nil != X1 ) ) )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ( app(X5,cons(X4,nil)) != X3 )
| ( app(cons(X4,nil),X5) != X2 )
| ~ ssList(X5) ) ) )
| ( ( nil = X3 )
& ( nil != X2 ) )
| ( X0 != X2 )
| ( X1 != X3 )
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.IwtzbaLUAs/Vampire---4.8_7814',co1) ).
tff(f260,plain,
( spl11_8
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f144,f236,f257]) ).
tff(f236,plain,
( spl11_4
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
tff(f144,plain,
( ~ neq(sK3,nil)
| ssItem(sK4) ),
inference(cnf_transformation,[],[f126]) ).
tff(f255,plain,
( spl11_7
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f145,f236,f252]) ).
tff(f145,plain,
( ~ neq(sK3,nil)
| ssList(sK5) ),
inference(cnf_transformation,[],[f126]) ).
tff(f250,plain,
( spl11_6
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f195,f236,f247]) ).
tff(f195,plain,
( ~ neq(sK3,nil)
| sQ10_eqProxy($i,sK2,app(cons(sK4,nil),sK5)) ),
inference(equality_proxy_replacement,[],[f146,f189]) ).
tff(f146,plain,
( ~ neq(sK3,nil)
| ( sK2 = app(cons(sK4,nil),sK5) ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f245,plain,
( spl11_5
| ~ spl11_4 ),
inference(avatar_split_clause,[],[f194,f236,f242]) ).
tff(f194,plain,
( ~ neq(sK3,nil)
| sQ10_eqProxy($i,sK3,app(sK5,cons(sK4,nil))) ),
inference(equality_proxy_replacement,[],[f147,f189]) ).
tff(f147,plain,
( ~ neq(sK3,nil)
| ( sK3 = app(sK5,cons(sK4,nil)) ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f240,plain,
( spl11_3
| spl11_4 ),
inference(avatar_split_clause,[],[f193,f236,f231]) ).
tff(f193,plain,
( neq(sK3,nil)
| sQ10_eqProxy($i,nil,sK3) ),
inference(equality_proxy_replacement,[],[f182,f189]) ).
tff(f182,plain,
( neq(sK3,nil)
| ( nil = sK3 ) ),
inference(definition_unfolding,[],[f148,f141,f141]) ).
tff(f141,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f126]) ).
tff(f148,plain,
( neq(sK1,nil)
| ( nil = sK1 ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f239,plain,
( ~ spl11_1
| spl11_4 ),
inference(avatar_split_clause,[],[f192,f236,f223]) ).
tff(f192,plain,
( neq(sK3,nil)
| ~ sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f181,f189]) ).
tff(f181,plain,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(definition_unfolding,[],[f149,f141,f142]) ).
tff(f142,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f126]) ).
tff(f149,plain,
( neq(sK1,nil)
| ( nil != sK0 ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f234,plain,
( spl11_3
| spl11_2 ),
inference(avatar_split_clause,[],[f191,f227,f231]) ).
tff(f191,plain,
! [X4: $i,X5: $i] :
( ~ sQ10_eqProxy($i,app(X5,cons(X4,nil)),sK3)
| ~ sQ10_eqProxy($i,app(cons(X4,nil),X5),sK2)
| ~ ssList(X5)
| ~ ssItem(X4)
| sQ10_eqProxy($i,nil,sK3) ),
inference(equality_proxy_replacement,[],[f180,f189]) ).
tff(f180,plain,
! [X4: $i,X5: $i] :
( ( app(X5,cons(X4,nil)) != sK3 )
| ( app(cons(X4,nil),X5) != sK2 )
| ~ ssList(X5)
| ~ ssItem(X4)
| ( nil = sK3 ) ),
inference(definition_unfolding,[],[f150,f141,f142,f141]) ).
tff(f150,plain,
! [X4: $i,X5: $i] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5)
| ~ ssItem(X4)
| ( nil = sK1 ) ),
inference(cnf_transformation,[],[f126]) ).
tff(f229,plain,
( ~ spl11_1
| spl11_2 ),
inference(avatar_split_clause,[],[f190,f227,f223]) ).
tff(f190,plain,
! [X4: $i,X5: $i] :
( ~ sQ10_eqProxy($i,app(X5,cons(X4,nil)),sK3)
| ~ sQ10_eqProxy($i,app(cons(X4,nil),X5),sK2)
| ~ ssList(X5)
| ~ ssItem(X4)
| ~ sQ10_eqProxy($i,nil,sK2) ),
inference(equality_proxy_replacement,[],[f179,f189]) ).
tff(f179,plain,
! [X4: $i,X5: $i] :
( ( app(X5,cons(X4,nil)) != sK3 )
| ( app(cons(X4,nil),X5) != sK2 )
| ~ ssList(X5)
| ~ ssItem(X4)
| ( nil != sK2 ) ),
inference(definition_unfolding,[],[f151,f141,f142,f142]) ).
tff(f151,plain,
! [X4: $i,X5: $i] :
( ( app(X5,cons(X4,nil)) != sK1 )
| ( app(cons(X4,nil),X5) != sK0 )
| ~ ssList(X5)
| ~ ssItem(X4)
| ( nil != sK0 ) ),
inference(cnf_transformation,[],[f126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC320+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/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.15/0.36 % Computer : n020.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.37 % DateTime : Tue Apr 30 18:15:02 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 This is a FOF_THM_RFO_SEQ problem
% 0.15/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.IwtzbaLUAs/Vampire---4.8_7814
% 0.61/0.76 % (8074)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 % (8067)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.61/0.76 % (8069)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 % (8068)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.61/0.76 % (8070)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 % (8071)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.76 % (8072)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.61/0.77 % (8067)First to succeed.
% 0.61/0.77 % (8073)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.61/0.77 % (8069)Also succeeded, but the first one will report.
% 0.61/0.77 % (8067)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 % (8067)------------------------------
% 0.61/0.77 % (8067)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (8067)Termination reason: Refutation
% 0.61/0.77
% 0.61/0.77 % (8067)Memory used [KB]: 1171
% 0.61/0.77 % (8067)Time elapsed: 0.007 s
% 0.61/0.77 % (8067)Instructions burned: 9 (million)
% 0.61/0.77 % (8067)------------------------------
% 0.61/0.77 % (8067)------------------------------
% 0.61/0.77 % (8063)Success in time 0.391 s
% 0.61/0.77 % Vampire---4.8 exiting
%------------------------------------------------------------------------------