TSTP Solution File: SWW624_2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWW624_2 : TPTP v8.1.2. Released v6.1.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 : n026.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:20:22 EDT 2024
% Result : Theorem 0.61s 0.82s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 61
% Syntax : Number of formulae : 113 ( 19 unt; 45 typ; 0 def)
% Number of atoms : 133 ( 28 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 118 ( 53 ~; 43 |; 9 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 144 ( 32 atm; 31 fun; 61 num; 20 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 61 ( 28 >; 33 *; 0 +; 0 <<)
% Number of predicates : 11 ( 7 usr; 3 prp; 0-3 aty)
% Number of functors : 40 ( 34 usr; 14 con; 0-5 aty)
% Number of variables : 99 ( 95 !; 4 ?; 99 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
uni: $tType ).
tff(type_def_6,type,
ty: $tType ).
tff(type_def_7,type,
bool: $tType ).
tff(type_def_8,type,
tuple0: $tType ).
tff(type_def_9,type,
elt: $tType ).
tff(type_def_10,type,
list_elt: $tType ).
tff(func_def_0,type,
witness: ty > uni ).
tff(func_def_1,type,
int: ty ).
tff(func_def_2,type,
real: ty ).
tff(func_def_3,type,
bool1: ty ).
tff(func_def_4,type,
true: bool ).
tff(func_def_5,type,
false: bool ).
tff(func_def_6,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(func_def_7,type,
tuple01: ty ).
tff(func_def_8,type,
tuple02: tuple0 ).
tff(func_def_9,type,
qtmark: ty ).
tff(func_def_12,type,
list: ty > ty ).
tff(func_def_13,type,
nil: ty > uni ).
tff(func_def_14,type,
cons: ( ty * uni * uni ) > uni ).
tff(func_def_15,type,
match_list: ( ty * ty * uni * uni * uni ) > uni ).
tff(func_def_16,type,
cons_proj_1: ( ty * uni ) > uni ).
tff(func_def_17,type,
cons_proj_2: ( ty * uni ) > uni ).
tff(func_def_18,type,
length: ( ty * uni ) > $int ).
tff(func_def_21,type,
infix_plpl: ( ty * uni * uni ) > uni ).
tff(func_def_22,type,
num_occ: ( ty * uni * uni ) > $int ).
tff(func_def_23,type,
reverse: ( ty * uni ) > uni ).
tff(func_def_24,type,
elt1: ty ).
tff(func_def_25,type,
t2tb: list_elt > uni ).
tff(func_def_26,type,
tb2t: uni > list_elt ).
tff(func_def_27,type,
t2tb1: elt > uni ).
tff(func_def_28,type,
tb2t1: uni > elt ).
tff(func_def_29,type,
rev_append: ( ty * uni * uni ) > uni ).
tff(func_def_30,type,
prefix: ( ty * $int * uni ) > uni ).
tff(func_def_32,type,
abs: $int > $int ).
tff(func_def_34,type,
div: ( $int * $int ) > $int ).
tff(func_def_35,type,
mod: ( $int * $int ) > $int ).
tff(func_def_36,type,
sK0: elt ).
tff(func_def_37,type,
sK1: list_elt ).
tff(func_def_38,type,
sK2: ( ty * uni * uni ) > uni ).
tff(func_def_39,type,
sK3: ( ty * uni * uni ) > uni ).
tff(pred_def_1,type,
sort: ( ty * uni ) > $o ).
tff(pred_def_3,type,
mem: ( ty * uni * uni ) > $o ).
tff(pred_def_5,type,
permut: ( ty * uni * uni ) > $o ).
tff(pred_def_6,type,
le: ( elt * elt ) > $o ).
tff(pred_def_7,type,
sorted: list_elt > $o ).
tff(f530,plain,
$false,
inference(avatar_sat_refutation,[],[f311,f457,f519]) ).
tff(f519,plain,
spl4_1,
inference(avatar_contradiction_clause,[],[f518]) ).
tff(f518,plain,
( $false
| spl4_1 ),
inference(evaluation,[],[f497]) ).
tff(f497,plain,
( ~ $less(0,$sum(1,0))
| spl4_1 ),
inference(superposition,[],[f306,f490]) ).
tff(f490,plain,
( ( 0 = length(elt1,t2tb(sK1)) )
| spl4_1 ),
inference(subsumption_resolution,[],[f486,f239]) ).
tff(f239,plain,
! [X0: ty,X1: uni] : ~ $less(length(X0,X1),0),
inference(cnf_transformation,[],[f156]) ).
tff(f156,plain,
! [X0: ty,X1: uni] : ~ $less(length(X0,X1),0),
inference(rectify,[],[f104]) ).
tff(f104,plain,
! [X0: ty,X12: uni] : ~ $less(length(X0,X12),0),
inference(theory_normalization,[],[f21]) ).
tff(f21,axiom,
! [X0: ty,X12: uni] : $lesseq(0,length(X0,X12)),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',length_nonnegative) ).
tff(f486,plain,
( $less(length(elt1,t2tb(sK1)),0)
| ( 0 = length(elt1,t2tb(sK1)) )
| spl4_1 ),
inference(resolution,[],[f485,f128]) ).
tff(f128,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
tff(f485,plain,
( ~ $less(0,length(elt1,t2tb(sK1)))
| spl4_1 ),
inference(evaluation,[],[f483]) ).
tff(f483,plain,
( ~ $less(0,length(elt1,t2tb(sK1)))
| ~ $less(0,1)
| spl4_1 ),
inference(superposition,[],[f473,f123]) ).
tff(f123,plain,
! [X0: $int] : ( $sum(X0,0) = X0 ),
introduced(theory_axiom_137,[]) ).
tff(f473,plain,
( ! [X0: $int] :
( ~ $less(0,$sum(length(elt1,t2tb(sK1)),X0))
| ~ $less(X0,1) )
| spl4_1 ),
inference(superposition,[],[f464,f121]) ).
tff(f121,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f464,plain,
( ! [X0: $int] :
( ~ $less(0,$sum(X0,length(elt1,t2tb(sK1))))
| ~ $less(X0,1) )
| spl4_1 ),
inference(resolution,[],[f459,f129]) ).
tff(f129,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less($sum(X0,X2),$sum(X1,X2))
| ~ $less(X0,X1) ),
introduced(theory_axiom_145,[]) ).
tff(f459,plain,
( ! [X0: $int] :
( ~ $less(X0,$sum(1,length(elt1,t2tb(sK1))))
| ~ $less(0,X0) )
| spl4_1 ),
inference(resolution,[],[f306,f127]) ).
tff(f127,plain,
! [X2: $int,X0: $int,X1: $int] :
( $less(X0,X2)
| ~ $less(X1,X2)
| ~ $less(X0,X1) ),
introduced(theory_axiom_143,[]) ).
tff(f306,plain,
( ~ $less(0,$sum(1,length(elt1,t2tb(sK1))))
| spl4_1 ),
inference(avatar_component_clause,[],[f304]) ).
tff(f304,plain,
( spl4_1
<=> $less(0,$sum(1,length(elt1,t2tb(sK1)))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
tff(f457,plain,
spl4_2,
inference(avatar_contradiction_clause,[],[f456]) ).
tff(f456,plain,
( $false
| spl4_2 ),
inference(subsumption_resolution,[],[f451,f293]) ).
tff(f293,plain,
permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1)),
inference(subsumption_resolution,[],[f292,f229]) ).
tff(f229,plain,
! [X0: ty,X1: uni] : permut(X0,X1,X1),
inference(cnf_transformation,[],[f148]) ).
tff(f148,plain,
! [X0: ty,X1: uni] : permut(X0,X1,X1),
inference(rectify,[],[f43]) ).
tff(f43,axiom,
! [X0: ty,X12: uni] : permut(X0,X12,X12),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',permut_refl) ).
tff(f292,plain,
( ~ permut(elt1,nil(elt1),nil(elt1))
| permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1)) ),
inference(forward_demodulation,[],[f291,f246]) ).
tff(f246,plain,
! [X0: ty,X1: uni] : ( nil(X0) = prefix(X0,0,X1) ),
inference(cnf_transformation,[],[f163]) ).
tff(f163,plain,
! [X0: ty,X1: uni] : ( nil(X0) = prefix(X0,0,X1) ),
inference(rectify,[],[f80]) ).
tff(f80,axiom,
! [X0: ty,X12: uni] : ( nil(X0) = prefix(X0,0,X12) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',prefix_def1) ).
tff(f291,plain,
( ~ permut(elt1,prefix(elt1,0,nil(elt1)),nil(elt1))
| permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1)) ),
inference(forward_demodulation,[],[f219,f282]) ).
tff(f282,plain,
! [X0: ty] : ( 0 = length(X0,nil(X0)) ),
inference(equality_resolution,[],[f238]) ).
tff(f238,plain,
! [X0: ty,X1: uni] :
( ( 0 = length(X0,X1) )
| ( nil(X0) != X1 ) ),
inference(cnf_transformation,[],[f211]) ).
tff(f211,plain,
! [X0: ty,X1: uni] :
( ( ( 0 = length(X0,X1) )
| ( nil(X0) != X1 ) )
& ( ( nil(X0) = X1 )
| ( 0 != length(X0,X1) ) ) ),
inference(nnf_transformation,[],[f155]) ).
tff(f155,plain,
! [X0: ty,X1: uni] :
( ( 0 = length(X0,X1) )
<=> ( nil(X0) = X1 ) ),
inference(rectify,[],[f22]) ).
tff(f22,axiom,
! [X0: ty,X12: uni] :
( ( 0 = length(X0,X12) )
<=> ( nil(X0) = X12 ) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',length_nil) ).
tff(f219,plain,
( permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1))
| ~ permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(cnf_transformation,[],[f210]) ).
tff(f210,plain,
( ( ~ permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
& permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1)) )
| ~ permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f180,f209]) ).
tff(f209,plain,
( ? [X0: elt,X1: list_elt] :
( ~ permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1)))
& permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1)) )
=> ( ~ permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
& permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1)) ) ),
introduced(choice_axiom,[]) ).
tff(f180,plain,
( ? [X0: elt,X1: list_elt] :
( ~ permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1)))
& permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1)) )
| ~ permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(ennf_transformation,[],[f139]) ).
tff(f139,plain,
~ ( ! [X0: elt,X1: list_elt] :
( permut(elt1,prefix(elt1,length(elt1,t2tb(X1)),t2tb(X1)),t2tb(X1))
=> permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))),cons(elt1,t2tb1(X0),t2tb(X1))) )
& permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(rectify,[],[f102]) ).
tff(f102,negated_conjecture,
~ ( ! [X1: elt,X2: list_elt] :
( permut(elt1,prefix(elt1,length(elt1,t2tb(X2)),t2tb(X2)),t2tb(X2))
=> permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X1),t2tb(X2))),cons(elt1,t2tb1(X1),t2tb(X2))),cons(elt1,t2tb1(X1),t2tb(X2))) )
& permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(negated_conjecture,[],[f101]) ).
tff(f101,conjecture,
( ! [X1: elt,X2: list_elt] :
( permut(elt1,prefix(elt1,length(elt1,t2tb(X2)),t2tb(X2)),t2tb(X2))
=> permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(X1),t2tb(X2))),cons(elt1,t2tb1(X1),t2tb(X2))),cons(elt1,t2tb1(X1),t2tb(X2))) )
& permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',permut_prefix) ).
tff(f451,plain,
( ~ permut(elt1,prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1)),t2tb(sK1))
| spl4_2 ),
inference(resolution,[],[f310,f226]) ).
tff(f226,plain,
! [X2: uni,X3: uni,X0: ty,X1: uni] :
( permut(X0,cons(X0,X1,X2),cons(X0,X1,X3))
| ~ permut(X0,X2,X3) ),
inference(cnf_transformation,[],[f183]) ).
tff(f183,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,cons(X0,X1,X2),cons(X0,X1,X3))
| ~ permut(X0,X2,X3) ),
inference(ennf_transformation,[],[f145]) ).
tff(f145,plain,
! [X0: ty,X1: uni,X2: uni,X3: uni] :
( permut(X0,X2,X3)
=> permut(X0,cons(X0,X1,X2),cons(X0,X1,X3)) ),
inference(rectify,[],[f46]) ).
tff(f46,axiom,
! [X0: ty,X1: uni,X14: uni,X13: uni] :
( permut(X0,X14,X13)
=> permut(X0,cons(X0,X1,X14),cons(X0,X1,X13)) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',permut_cons) ).
tff(f310,plain,
( ~ permut(elt1,cons(elt1,t2tb1(sK0),prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
| spl4_2 ),
inference(avatar_component_clause,[],[f308]) ).
tff(f308,plain,
( spl4_2
<=> permut(elt1,cons(elt1,t2tb1(sK0),prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
tff(f311,plain,
( ~ spl4_1
| ~ spl4_2 ),
inference(avatar_split_clause,[],[f302,f308,f304]) ).
tff(f302,plain,
( ~ permut(elt1,cons(elt1,t2tb1(sK0),prefix(elt1,length(elt1,t2tb(sK1)),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
| ~ $less(0,$sum(1,length(elt1,t2tb(sK1)))) ),
inference(evaluation,[],[f301]) ).
tff(f301,plain,
( ~ permut(elt1,cons(elt1,t2tb1(sK0),prefix(elt1,$sum($sum(1,length(elt1,t2tb(sK1))),-1),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
| ~ $less(0,$sum(1,length(elt1,t2tb(sK1)))) ),
inference(superposition,[],[f290,f285]) ).
tff(f285,plain,
! [X2: uni,X3: uni,X0: ty,X1: $int] :
( ( prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,-1),X3)) )
| ~ $less(0,X1) ),
inference(evaluation,[],[f245]) ).
tff(f245,plain,
! [X2: uni,X3: uni,X0: ty,X1: $int] :
( ( prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)) )
| ~ $less(0,X1) ),
inference(cnf_transformation,[],[f192]) ).
tff(f192,plain,
! [X0: ty,X1: $int,X2: uni,X3: uni] :
( ( prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)) )
| ~ $less(0,X1) ),
inference(ennf_transformation,[],[f162]) ).
tff(f162,plain,
! [X0: ty,X1: $int,X2: uni,X3: uni] :
( $less(0,X1)
=> ( prefix(X0,X1,cons(X0,X2,X3)) = cons(X0,X2,prefix(X0,$sum(X1,$uminus(1)),X3)) ) ),
inference(rectify,[],[f105]) ).
tff(f105,plain,
! [X0: ty,X24: $int,X1: uni,X12: uni] :
( $less(0,X24)
=> ( prefix(X0,X24,cons(X0,X1,X12)) = cons(X0,X1,prefix(X0,$sum(X24,$uminus(1)),X12)) ) ),
inference(theory_normalization,[],[f81]) ).
tff(f81,axiom,
! [X0: ty,X24: $int,X1: uni,X12: uni] :
( $less(0,X24)
=> ( prefix(X0,X24,cons(X0,X1,X12)) = cons(X0,X1,prefix(X0,$difference(X24,1),X12)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',prefix_def2) ).
tff(f290,plain,
~ permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),
inference(subsumption_resolution,[],[f289,f229]) ).
tff(f289,plain,
( ~ permut(elt1,nil(elt1),nil(elt1))
| ~ permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))) ),
inference(forward_demodulation,[],[f288,f246]) ).
tff(f288,plain,
( ~ permut(elt1,prefix(elt1,0,nil(elt1)),nil(elt1))
| ~ permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))) ),
inference(forward_demodulation,[],[f287,f282]) ).
tff(f287,plain,
( ~ permut(elt1,prefix(elt1,$sum(1,length(elt1,t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
| ~ permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(forward_demodulation,[],[f220,f256]) ).
tff(f256,plain,
! [X2: uni,X0: ty,X1: uni] : ( length(X0,cons(X0,X1,X2)) = $sum(1,length(X0,X2)) ),
inference(cnf_transformation,[],[f20]) ).
tff(f20,axiom,
! [X0: ty] :
( ! [X1: uni,X2: uni] : ( length(X0,cons(X0,X1,X2)) = $sum(1,length(X0,X2)) )
& ( 0 = length(X0,nil(X0)) ) ),
file('/export/starexec/sandbox2/tmp/tmp.fXY7HeORtP/Vampire---4.8_28052',length_def) ).
tff(f220,plain,
( ~ permut(elt1,prefix(elt1,length(elt1,cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1))),cons(elt1,t2tb1(sK0),t2tb(sK1)))
| ~ permut(elt1,prefix(elt1,length(elt1,nil(elt1)),nil(elt1)),nil(elt1)) ),
inference(cnf_transformation,[],[f210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.10 % Problem : SWW624_2 : TPTP v8.1.2. Released v6.1.0.
% 0.04/0.11 % 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.11/0.31 % Computer : n026.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 30 18:16:20 EDT 2024
% 0.11/0.31 % CPUTime :
% 0.11/0.31 This is a TF0_THM_EQU_ARI problem
% 0.11/0.31 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.fXY7HeORtP/Vampire---4.8_28052
% 0.61/0.80 % (28168)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.61/0.80 % (28169)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.61/0.80 % (28166)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.61/0.80 % (28167)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.61/0.80 % (28170)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.61/0.80 % (28171)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.61/0.80 % (28172)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.61/0.80 % (28173)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.61/0.81 % (28171)First to succeed.
% 0.61/0.82 % (28170)Instruction limit reached!
% 0.61/0.82 % (28170)------------------------------
% 0.61/0.82 % (28170)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (28170)Termination reason: Unknown
% 0.61/0.82 % (28170)Termination phase: Saturation
% 0.61/0.82
% 0.61/0.82 % (28170)Memory used [KB]: 1387
% 0.61/0.82 % (28170)Time elapsed: 0.017 s
% 0.61/0.82 % (28170)Instructions burned: 34 (million)
% 0.61/0.82 % (28170)------------------------------
% 0.61/0.82 % (28170)------------------------------
% 0.61/0.82 % (28171)Refutation found. Thanks to Tanya!
% 0.61/0.82 % SZS status Theorem for Vampire---4
% 0.61/0.82 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.82 % (28171)------------------------------
% 0.61/0.82 % (28171)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.82 % (28171)Termination reason: Refutation
% 0.61/0.82
% 0.61/0.82 % (28171)Memory used [KB]: 1278
% 0.61/0.82 % (28171)Time elapsed: 0.017 s
% 0.61/0.82 % (28171)Instructions burned: 29 (million)
% 0.61/0.82 % (28171)------------------------------
% 0.61/0.82 % (28171)------------------------------
% 0.61/0.82 % (28163)Success in time 0.486 s
% 0.61/0.82 % Vampire---4.8 exiting
%------------------------------------------------------------------------------