TSTP Solution File: SWC009+1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SWC009+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 : 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:59:11 EDT 2024
% Result : Theorem 0.55s 0.75s
% Output : Refutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 12 unt; 0 def)
% Number of atoms : 403 ( 163 equ)
% Maximal formula atoms : 46 ( 9 avg)
% Number of connectives : 583 ( 222 ~; 189 |; 148 &)
% ( 0 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 180 ( 124 !; 56 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f611,plain,
$false,
inference(subsumption_resolution,[],[f610,f175]) ).
fof(f175,plain,
ssList(sK2),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
( ( nil != sK2
| nil = sK3 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3)
& ssList(sK2)
& ssList(sK1)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f100,f149,f148,f147,f146,f145]) ).
fof(f145,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = X2
& sK1 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X3] :
( ( nil != sK2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = sK2
& sK1 = X3
& ssList(X3) )
=> ( ( nil != sK2
| nil = sK3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& app(sK2,X4) = sK3
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK2)
& sK3 = app(sK2,sK4)
& ssList(sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f100,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f99]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& 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)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X9,X11) = X0
& app(app(X9,X10),X11) = X1
& ssList(X11) )
& ssList(X10) )
& ssList(X9) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& 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)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0iG6L7sLjv/Vampire---4.8_1400',co1) ).
fof(f610,plain,
~ ssList(sK2),
inference(trivial_inequality_removal,[],[f609]) ).
fof(f609,plain,
( sK2 != sK2
| ~ ssList(sK2) ),
inference(superposition,[],[f608,f196]) ).
fof(f196,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.0iG6L7sLjv/Vampire---4.8_1400',ax84) ).
fof(f608,plain,
sK2 != app(sK2,nil),
inference(subsumption_resolution,[],[f607,f207]) ).
fof(f207,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/tmp/tmp.0iG6L7sLjv/Vampire---4.8_1400',ax17) ).
fof(f607,plain,
( sK2 != app(sK2,nil)
| ~ ssList(nil) ),
inference(trivial_inequality_removal,[],[f604]) ).
fof(f604,plain,
( sK3 != sK3
| sK2 != app(sK2,nil)
| ~ ssList(nil) ),
inference(superposition,[],[f465,f317]) ).
fof(f317,plain,
sK3 = app(sK3,nil),
inference(forward_demodulation,[],[f316,f181]) ).
fof(f181,plain,
sK3 = app(sK2,sK4),
inference(cnf_transformation,[],[f150]) ).
fof(f316,plain,
app(sK2,sK4) = app(sK3,nil),
inference(subsumption_resolution,[],[f315,f180]) ).
fof(f180,plain,
ssList(sK4),
inference(cnf_transformation,[],[f150]) ).
fof(f315,plain,
( app(sK2,sK4) = app(sK3,nil)
| ~ ssList(sK4) ),
inference(subsumption_resolution,[],[f303,f207]) ).
fof(f303,plain,
( app(sK2,sK4) = app(sK3,nil)
| ~ ssList(nil)
| ~ ssList(sK4) ),
inference(superposition,[],[f281,f196]) ).
fof(f281,plain,
! [X0] :
( app(sK2,app(sK4,X0)) = app(sK3,X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f280,f175]) ).
fof(f280,plain,
! [X0] :
( app(sK2,app(sK4,X0)) = app(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f261,f180]) ).
fof(f261,plain,
! [X0] :
( app(sK2,app(sK4,X0)) = app(sK3,X0)
| ~ ssList(X0)
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f200,f181]) ).
fof(f200,plain,
! [X2,X0,X1] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f110]) ).
fof(f110,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( app(app(X0,X1),X2) = app(X0,app(X1,X2))
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f82]) ).
fof(f82,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> app(app(X0,X1),X2) = app(X0,app(X1,X2)) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.0iG6L7sLjv/Vampire---4.8_1400',ax82) ).
fof(f465,plain,
! [X0] :
( sK3 != app(sK3,X0)
| sK2 != app(sK2,X0)
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f464,f175]) ).
fof(f464,plain,
! [X0] :
( sK3 != app(sK3,X0)
| sK2 != app(sK2,X0)
| ~ ssList(X0)
| ~ ssList(sK2) ),
inference(subsumption_resolution,[],[f449,f180]) ).
fof(f449,plain,
! [X0] :
( sK3 != app(sK3,X0)
| sK2 != app(sK2,X0)
| ~ ssList(X0)
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[],[f239,f181]) ).
fof(f239,plain,
! [X10,X11,X9] :
( app(app(X9,X10),X11) != sK3
| app(X9,X11) != sK2
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f179,f178,f177]) ).
fof(f177,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f150]) ).
fof(f178,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f150]) ).
fof(f179,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK0
| app(app(X9,X10),X11) != sK1
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC009+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/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36 % Computer : n019.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Apr 30 18:18:59 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a FOF_THM_RFO_SEQ problem
% 0.14/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.0iG6L7sLjv/Vampire---4.8_1400
% 0.55/0.74 % (1604)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.55/0.74 % (1606)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.55/0.74 % (1599)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.55/0.74 % (1601)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.55/0.74 % (1600)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.55/0.74 % (1602)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.55/0.74 % (1603)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.55/0.75 % (1605)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.55/0.75 % (1604)First to succeed.
% 0.55/0.75 % (1601)Also succeeded, but the first one will report.
% 0.55/0.75 % (1604)Refutation found. Thanks to Tanya!
% 0.55/0.75 % SZS status Theorem for Vampire---4
% 0.55/0.75 % SZS output start Proof for Vampire---4
% See solution above
% 0.55/0.75 % (1604)------------------------------
% 0.55/0.75 % (1604)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.55/0.75 % (1604)Termination reason: Refutation
% 0.55/0.75
% 0.55/0.75 % (1604)Memory used [KB]: 1306
% 0.55/0.75 % (1604)Time elapsed: 0.008 s
% 0.55/0.75 % (1604)Instructions burned: 24 (million)
% 0.55/0.75 % (1604)------------------------------
% 0.55/0.75 % (1604)------------------------------
% 0.55/0.75 % (1561)Success in time 0.375 s
% 0.55/0.75 % Vampire---4.8 exiting
%------------------------------------------------------------------------------