TSTP Solution File: LCL763_5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : LCL763_5 : TPTP v8.1.2. Released v6.0.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 : n019.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:19:55 EDT 2024
% Result : Theorem 0.60s 0.83s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 101
% Syntax : Number of formulae : 121 ( 7 unt; 94 typ; 0 def)
% Number of atoms : 152 ( 53 equ)
% Maximal formula atoms : 12 ( 5 avg)
% Number of connectives : 177 ( 52 ~; 56 |; 60 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 157 ( 81 >; 76 *; 0 +; 0 <<)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 80 ( 80 usr; 6 con; 0-5 aty)
% Number of variables : 150 ( 61 !; 42 ?; 150 :)
% ( 47 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,fun(dB,bool)) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_7,type,
dB_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
step1:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(list(X0),fun(list(X0),bool)) ) ).
tff(func_def_12,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_17,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_20,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_21,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_22,type,
conversep:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,bool)) > fun(X1,fun(X0,bool)) ) ).
tff(func_def_23,type,
accp:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(X0,bool) ) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_28,type,
n: nat ).
tff(func_def_29,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_30,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_31,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_32,type,
sK8: dB > dB ).
tff(func_def_33,type,
sK9: dB > dB ).
tff(func_def_34,type,
sK10: dB > list(dB) ).
tff(func_def_35,type,
sK11: dB > dB ).
tff(func_def_36,type,
sK12: dB > list(dB) ).
tff(func_def_37,type,
sK13: dB > nat ).
tff(func_def_38,type,
sK14: dB > dB ).
tff(func_def_39,type,
sK15: dB > dB ).
tff(func_def_40,type,
sK16: dB > dB ).
tff(func_def_41,type,
sK17: dB > nat ).
tff(func_def_42,type,
sK18: dB > list(dB) ).
tff(func_def_43,type,
sK19: dB > dB ).
tff(func_def_44,type,
sK20: dB > dB ).
tff(func_def_45,type,
sK21: dB > nat ).
tff(func_def_46,type,
sK22: ( dB * dB ) > dB ).
tff(func_def_47,type,
sK23: ( dB * dB * dB ) > dB ).
tff(func_def_48,type,
sK24: ( dB * dB * dB ) > dB ).
tff(func_def_49,type,
sK25: ( dB * dB * dB ) > dB ).
tff(func_def_50,type,
sK26: ( dB * list(dB) * nat ) > list(dB) ).
tff(func_def_51,type,
sK27: ( dB * dB ) > dB ).
tff(func_def_52,type,
sK28: ( dB * dB ) > dB ).
tff(func_def_53,type,
sK29: ( dB * dB ) > dB ).
tff(func_def_54,type,
sK30: ( dB * dB ) > dB ).
tff(func_def_55,type,
sK31: ( dB * dB ) > dB ).
tff(func_def_56,type,
sK32: ( dB * dB ) > dB ).
tff(func_def_57,type,
sK33: ( dB * dB ) > dB ).
tff(func_def_58,type,
sK34: ( dB * dB ) > dB ).
tff(func_def_59,type,
sK35: ( dB * dB ) > dB ).
tff(func_def_60,type,
sK36: ( dB * dB ) > dB ).
tff(func_def_61,type,
sK37: ( dB * list(dB) * dB ) > dB ).
tff(func_def_62,type,
sK38: ( dB * list(dB) * dB ) > dB ).
tff(func_def_63,type,
sK39: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_64,type,
sK40: ( dB * list(dB) * dB ) > list(dB) ).
tff(func_def_65,type,
sK41: ( dB * list(dB) * dB ) > dB ).
tff(func_def_66,type,
sK42:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_67,type,
sK43:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_68,type,
sK44:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_69,type,
sK45:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_70,type,
sK46:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_71,type,
sK47:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_72,type,
sK48:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_73,type,
sK49:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > list(X0) ) ).
tff(func_def_74,type,
sK50:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * fun(X0,fun(X0,bool)) ) > X0 ) ).
tff(func_def_75,type,
sK51:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 * fun(X0,fun(X1,bool)) ) > X0 ) ).
tff(func_def_76,type,
sK52:
!>[X0: $tType,X1: $tType] : ( ( X0 * X1 * fun(X0,fun(X1,bool)) ) > X1 ) ).
tff(func_def_77,type,
sK53: ( list(dB) * dB * dB * dB ) > list(dB) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP0: dB > $o ).
tff(pred_def_7,type,
sP1: ( dB * dB ) > $o ).
tff(pred_def_8,type,
sP2: ( dB * dB ) > $o ).
tff(pred_def_9,type,
sP3: ( dB * dB ) > $o ).
tff(pred_def_10,type,
sP4: ( dB * list(dB) * dB ) > $o ).
tff(pred_def_11,type,
sQ54_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f756,plain,
$false,
inference(subsumption_resolution,[],[f751,f594]) ).
tff(f594,plain,
! [X0: $tType,X2: fun(X0,bool)] : listsp(X0,X2,nil(X0)),
inference(equality_resolution,[],[f518]) ).
tff(f518,plain,
! [X0: $tType,X2: fun(X0,bool),X1: list(X0)] :
( listsp(X0,X2,X1)
| ( nil(X0) != X1 ) ),
inference(cnf_transformation,[],[f337]) ).
tff(f337,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( cons(X0,X3,X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ( listsp(X0,X2,sK44(X0,X1,X2))
& pp(aa(X0,bool,X2,sK43(X0,X1,X2)))
& ( cons(X0,sK43(X0,X1,X2),sK44(X0,X1,X2)) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK43,sK44])],[f335,f336]) ).
tff(f336,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( cons(X0,X5,X6) = X1 ) )
=> ( listsp(X0,X2,sK44(X0,X1,X2))
& pp(aa(X0,bool,X2,sK43(X0,X1,X2)))
& ( cons(X0,sK43(X0,X1,X2),sK44(X0,X1,X2)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f335,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( cons(X0,X3,X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X5: X0,X6: list(X0)] :
( listsp(X0,X2,X6)
& pp(aa(X0,bool,X2,X5))
& ( cons(X0,X5,X6) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(rectify,[],[f334]) ).
tff(f334,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( cons(X0,X3,X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( cons(X0,X3,X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(flattening,[],[f333]) ).
tff(f333,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( ( listsp(X0,X2,X1)
| ( ! [X3: X0,X4: list(X0)] :
( ~ listsp(X0,X2,X4)
| ~ pp(aa(X0,bool,X2,X3))
| ( cons(X0,X3,X4) != X1 ) )
& ( nil(X0) != X1 ) ) )
& ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( cons(X0,X3,X4) = X1 ) )
| ( nil(X0) = X1 )
| ~ listsp(X0,X2,X1) ) ),
inference(nnf_transformation,[],[f189]) ).
tff(f189,plain,
! [X0: $tType,X1: list(X0),X2: fun(X0,bool)] :
( listsp(X0,X2,X1)
<=> ( ? [X3: X0,X4: list(X0)] :
( listsp(X0,X2,X4)
& pp(aa(X0,bool,X2,X3))
& ( cons(X0,X3,X4) = X1 ) )
| ( nil(X0) = X1 ) ) ),
inference(rectify,[],[f84]) ).
tff(f84,axiom,
! [X0: $tType,X19: list(X0),X26: fun(X0,bool)] :
( listsp(X0,X26,X19)
<=> ( ? [X81: X0,X82: list(X0)] :
( listsp(X0,X26,X82)
& pp(aa(X0,bool,X26,X81))
& ( cons(X0,X81,X82) = X19 ) )
| ( nil(X0) = X19 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BGzgDZcR1q/Vampire---4.8_14871',fact_83_listsp_Osimps) ).
tff(f751,plain,
~ listsp(dB,it,nil(dB)),
inference(resolution,[],[f559,f577]) ).
tff(f577,plain,
! [X2: list(dB),X3: nat] :
( pp(aa(dB,bool,it,foldl(dB,dB,app,var(X3),X2)))
| ~ listsp(dB,it,X2) ),
inference(equality_resolution,[],[f411]) ).
tff(f411,plain,
! [X2: list(dB),X3: nat,X0: dB] :
( pp(aa(dB,bool,it,X0))
| ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ),
inference(cnf_transformation,[],[f280]) ).
tff(f280,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ( ~ sP0(X0)
& ! [X1: dB] :
( ~ pp(aa(dB,bool,it,X1))
| ( abs(X1) != X0 ) )
& ! [X2: list(dB),X3: nat] :
( ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ) ) )
& ( sP0(X0)
| ( pp(aa(dB,bool,it,sK11(X0)))
& ( abs(sK11(X0)) = X0 ) )
| ( listsp(dB,it,sK12(X0))
& ( foldl(dB,dB,app,var(sK13(X0)),sK12(X0)) = X0 ) )
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK11,sK12,sK13])],[f277,f279,f278]) ).
tff(f278,plain,
! [X0: dB] :
( ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
=> ( pp(aa(dB,bool,it,sK11(X0)))
& ( abs(sK11(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f279,plain,
! [X0: dB] :
( ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
=> ( listsp(dB,it,sK12(X0))
& ( foldl(dB,dB,app,var(sK13(X0)),sK12(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f277,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ( ~ sP0(X0)
& ! [X1: dB] :
( ~ pp(aa(dB,bool,it,X1))
| ( abs(X1) != X0 ) )
& ! [X2: list(dB),X3: nat] :
( ~ listsp(dB,it,X2)
| ( foldl(dB,dB,app,var(X3),X2) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(rectify,[],[f276]) ).
tff(f276,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ( ~ sP0(X0)
& ! [X4: dB] :
( ~ pp(aa(dB,bool,it,X4))
| ( abs(X4) != X0 ) )
& ! [X5: list(dB),X6: nat] :
( ~ listsp(dB,it,X5)
| ( foldl(dB,dB,app,var(X6),X5) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(flattening,[],[f275]) ).
tff(f275,plain,
! [X0: dB] :
( ( pp(aa(dB,bool,it,X0))
| ( ~ sP0(X0)
& ! [X4: dB] :
( ~ pp(aa(dB,bool,it,X4))
| ( abs(X4) != X0 ) )
& ! [X5: list(dB),X6: nat] :
( ~ listsp(dB,it,X5)
| ( foldl(dB,dB,app,var(X6),X5) != X0 ) ) ) )
& ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) )
| ~ pp(aa(dB,bool,it,X0)) ) ),
inference(nnf_transformation,[],[f247]) ).
tff(f247,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
<=> ( sP0(X0)
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) ) ) ),
inference(definition_folding,[],[f133,f246]) ).
tff(f246,plain,
! [X0: dB] :
( sP0(X0)
<=> ? [X1: dB,X2: dB,X3: list(dB)] :
( pp(aa(dB,bool,it,X2))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X1,X2,zero_zero(nat)),X3)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X2),X3) = X0 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f133,plain,
! [X0: dB] :
( pp(aa(dB,bool,it,X0))
<=> ( ? [X1: dB,X2: dB,X3: list(dB)] :
( pp(aa(dB,bool,it,X2))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X1,X2,zero_zero(nat)),X3)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X1)),X2),X3) = X0 ) )
| ? [X4: dB] :
( pp(aa(dB,bool,it,X4))
& ( abs(X4) = X0 ) )
| ? [X5: list(dB),X6: nat] :
( listsp(dB,it,X5)
& ( foldl(dB,dB,app,var(X6),X5) = X0 ) ) ) ),
inference(rectify,[],[f27]) ).
tff(f27,axiom,
! [X19: dB] :
( pp(aa(dB,bool,it,X19))
<=> ( ? [X42: dB,X43: dB,X44: list(dB)] :
( pp(aa(dB,bool,it,X43))
& pp(aa(dB,bool,it,foldl(dB,dB,app,subst(X42,X43,zero_zero(nat)),X44)))
& ( foldl(dB,dB,app,aa(dB,dB,aa(dB,fun(dB,dB),app,abs(X42)),X43),X44) = X19 ) )
| ? [X42: dB] :
( pp(aa(dB,bool,it,X42))
& ( abs(X42) = X19 ) )
| ? [X40: list(dB),X41: nat] :
( listsp(dB,it,X40)
& ( foldl(dB,dB,app,var(X41),X40) = X19 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.BGzgDZcR1q/Vampire---4.8_14871',fact_26_IT_Osimps) ).
tff(f559,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(cnf_transformation,[],[f207]) ).
tff(f207,plain,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(flattening,[],[f106]) ).
tff(f106,negated_conjecture,
~ pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(negated_conjecture,[],[f105]) ).
tff(f105,conjecture,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
file('/export/starexec/sandbox/tmp/tmp.BGzgDZcR1q/Vampire---4.8_14871',conj_0) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LCL763_5 : TPTP v8.1.2. Released v6.0.0.
% 0.09/0.12 % 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.11/0.32 % Computer : n019.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Apr 30 16:36:44 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TF1_THM_EQU_NAR problem
% 0.11/0.32 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.BGzgDZcR1q/Vampire---4.8_14871
% 0.60/0.82 % (14981)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.60/0.82 % (14982)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.60/0.82 % (14979)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.60/0.82 % (14980)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.60/0.82 % (14985)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.60/0.82 % (14983)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.60/0.82 % (14986)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.60/0.82 % (14987)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.60/0.82 % (14986)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.82 % (14987)Refutation not found, incomplete strategy% (14987)------------------------------
% 0.60/0.82 % (14987)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (14985)Refutation not found, incomplete strategy% (14985)------------------------------
% 0.60/0.82 % (14985)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.82 % (14985)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (14985)Memory used [KB]: 1210
% 0.60/0.82 % (14985)Time elapsed: 0.007 s
% 0.60/0.82 % (14985)Instructions burned: 12 (million)
% 0.60/0.82 % (14985)------------------------------
% 0.60/0.82 % (14985)------------------------------
% 0.60/0.82 % (14987)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.82
% 0.60/0.82 % (14987)Memory used [KB]: 1196
% 0.60/0.82 % (14987)Time elapsed: 0.007 s
% 0.60/0.82 % (14987)Instructions burned: 11 (million)
% 0.60/0.82 % (14987)------------------------------
% 0.60/0.82 % (14987)------------------------------
% 0.60/0.82 % (14986)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.60/0.83 % (14988)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 (2995ds/55Mi)
% 0.60/0.83 % (14989)dis+3_25:4_sil=16000:sos=all:erd=off:i=50:s2at=4.0:bd=off:nm=60:sup=off:cond=on:av=off:ins=2:nwc=10.0:etr=on:to=lpo:s2agt=20:fd=off:bsr=unit_only:slsq=on:slsqr=28,19:awrs=converge:awrsf=500:tgt=ground:bs=unit_only_0 on Vampire---4 for (2995ds/50Mi)
% 0.60/0.83 % (14986)Refutation not found, incomplete strategy% (14986)------------------------------
% 0.60/0.83 % (14986)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.83 % (14986)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.83
% 0.60/0.83 % (14986)Memory used [KB]: 1402
% 0.60/0.83 % (14986)Time elapsed: 0.013 s
% 0.60/0.83 % (14983)First to succeed.
% 0.60/0.83 % (14986)Instructions burned: 24 (million)
% 0.60/0.83 % (14986)------------------------------
% 0.60/0.83 % (14986)------------------------------
% 0.60/0.83 % (14983)Refutation found. Thanks to Tanya!
% 0.60/0.83 % SZS status Theorem for Vampire---4
% 0.60/0.83 % SZS output start Proof for Vampire---4
% See solution above
% 0.60/0.83 % (14983)------------------------------
% 0.60/0.83 % (14983)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.60/0.83 % (14983)Termination reason: Refutation
% 0.60/0.83
% 0.60/0.83 % (14983)Memory used [KB]: 1450
% 0.60/0.83 % (14983)Time elapsed: 0.015 s
% 0.60/0.83 % (14983)Instructions burned: 29 (million)
% 0.60/0.83 % (14983)------------------------------
% 0.60/0.83 % (14983)------------------------------
% 0.60/0.83 % (14978)Success in time 0.503 s
% 0.60/0.83 % Vampire---4.8 exiting
%------------------------------------------------------------------------------